Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
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
Improving Data Access in P2P Systems
IEEE Internet Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: prefix hash tree
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Range Queries in Trie-Structured Overlays
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
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
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
The SkipTrie: low-depth concurrent search without rebalancing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In this paper, we present Pampoo, a novel distributed framework for efficient query processing in P2P systems. We propose a new locality preserving data structure Skip-trie as its substrate. Skip-trie incorporates the advantages of skip graph with features of traditional trie. Thus, Pampoo can efficiently support various types of queries such as range queries and k nearest neighbor queries. We study the time cost of search and update operations on Skip-trie structure under our Pampoo framework. We further briefly present a repairing strategy to boost the robustness of Pampoo system. Extensive experiments are conducted to verify the effectiveness and efficiency of our approach.