SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data

This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. The SkipTree supports range queries as well as single point queries which are routed in O(log n) hops. SkipTree is fully decentralized with each node being connected to O(log n) other nodes. The memory usage for maintaining the links at each node is O(log n log log n) on average and O(log2n) in the worst case. Load balance is also guaranteed to be within a constant factor.

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

[2]  Peter Vojtáš.  SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings , 2005, SOFSEM.

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

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

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

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

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

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

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

[10]  Roman Schmidt,et al.  Technical University of Vienna Improving Data Access in P 2 P Systems , 2001 .

[11]  Karl Aberer,et al.  Efficient Search in Unbalanced, Randomized Peer-To-Peer Search Trees , 2002 .

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

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

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

[15]  Witold Litwin,et al.  RP: A Family of Order Preserving Scalable , 1994 .

[16]  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.

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

[18]  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).

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

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

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

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

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