A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Range Addressable Network: A P2P Cache Architecture for Data Ranges
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
A Peer-to-peer Framework for Caching Range Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
On Small World Graphs in Non-uniformly Distributed Key Spaces
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
Symphony: distributed hashing in a small world
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
| Hi-index | 0.00 |
Range query, which is defined as retrieving all the keys within a certain range over the underlying DHT, has attracted a lot of attention recently. However, little has been done to speed up range queries through caching, one of the least studied P2P problems. In this paper, we present a caching protocol that (1) has excellent parallelizability, (2) can achieve O(1) complexity for moderate range queries, and (3) balances the access load among all the DHT peers. Our experimental results shows significant gains in both range query performance and load balancing, with minimal overhead.