Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Skip lists and probabilistic analysis of algorithms
Skip lists and probabilistic analysis of algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Open Problems in Data-Sharing Peer-to-Peer Systems
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Speeding up search in peer-to-peer networks with a multi-way tree structure
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Delay-Bounded Range Queries in DHT-based Peer-to-Peer Systems
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
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
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Semantic partitioning of peer-to-peer search space
Computer Communications
Replica-aware, multi-dimensional range queries in Distributed Hash Tables
Computer Communications
| Hi-index | 0.24 |
The support for complex queries, such as range, prefix and aggregation queries, over structured peer-to-peer systems is currently an active and significant topic of research. This paper demonstrates how Skip Tree Graph, as a novel structure, presents an efficient solution to that problem area through provision of a distributed search tree functionality on decentralised and dynamic environments. Since Skip Tree Graph is based on skip trees, a concurrent approach to skip lists, it constitutes an augmentation of skip graphs that extends its functionality and allows for important performance improvements. This work presents a thorough comparison between these two related peer-to-peer overlay networks, their construction, search algorithms and properties. Being based on tree structures, skip tree graphs supports aggregation queries and multicast/broadcast operations, which cannot be directly implemented in its predecessor. The repair mechanism for healing the structure in case of failures is more efficient and harnesses the parallelism inherent in P2P networks. Particular consideration is given to the performance of different range-query schemes over the two related structures. Theoretical and experimental results conclude that Skip Tree Graphs outperform skip graphs on both exact-match and range searches.