Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Improving Data Access in P2P Systems
IEEE Internet Computing
A Distributed Data-Balanced Dictionary Based on the B-Link Tree
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Balanced Distributed Search Trees Do Not Exist
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Simple efficient load balancing algorithms for peer-to-peer systems
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
RAQ: a range-queriable distributed data structure
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
| Hi-index | 0.24 |
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.