Skiptree: A new scalable distributed data structure on multidimensional data supporting range-queries

This paper presents a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. It supports range queries as well as single point queries which are routed in O(logn) hops. Our structure, called SkipTree, is fully decentralized with each node being connected to O(logn) other nodes. We propose modifications to the structures, so that the memory usage for maintaining the link structure at each node is reduced from the worst case of O(n) to O(lognloglogn) on the average and O(log^2n) in the worst case. It is also shown that the load balancing is guaranteed to be within a constant factor. Our experimental results verify our theoretical proofs.

[1]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[2]  Mohammad Ghodsi,et al.  RAQ: A Range-Queriable Distributed Data Structure , 2005, SOFSEM.

[3]  Peter Widmayer,et al.  Distributing a search tree among a growing number of processors , 1994, SIGMOD '94.

[4]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[5]  Aris M. Ouksel,et al.  G-Grid: A Class of Scalable and Self-Organizing Data Structures for Multi-dimensional Querying and Content Routing in P2P Networks , 2003, AP2PC.

[6]  Jie Wu,et al.  Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[8]  Mohammad Ghodsi,et al.  SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data , 2005, ISAAC.

[9]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2004, SPAA '04.

[10]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[11]  Viktor Prasanna,et al.  Proceedings of the 6th International Parallel Processing Symposium , 1992 .

[12]  Chun Zhang,et al.  Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[13]  Witold Litwin,et al.  RP*: A Family of Order Preserving Scalable Distributed Data Structures , 1994, VLDB.

[14]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[15]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[16]  Johannes Gehrke,et al.  Querying peer-to-peer networks using P-trees , 2004, WebDB '04.

[17]  Nicholas J. A. Harvey,et al.  Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time , 2004, SODA '04.

[18]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[19]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[20]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[21]  Beng Chin Ooi,et al.  PeerDB: a P2P-based system for distributed data sharing , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[22]  Karl Aberer.  Scalable Data Access in Peer-to-Peer Systems Using Unbalanced Search Trees , 2002, WDAS.

[23]  Peter Widmayer,et al.  Balanced Distributed Search Trees Do Not Exist , 1995, WADS.

[24]  Karl Aberer,et al.  Improving Data Access in P2P Systems , 2002, IEEE Internet Comput..

[25]  Theodore Johnson,et al.  A distributed data-balanced dictionary based on the B-link tree , 1992, Proceedings Sixth International Parallel Processing Symposium.

[26]  Pierre Fraigniaud,et al.  D2B: A de Bruijn based content-addressable network , 2006, Theor. Comput. Sci..

[27]  Witold Litwin,et al.  LH*—a scalable, distributed data structure , 1996, TODS.

[28]  Jie Wu,et al.  FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..