Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
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
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Hi-index | 0.00 |
A fundamental problem that confronts peer-to-peer applicationsis to efficiently locate the node that stores a particulardata item. DHT-based scheme improves the scalabilityand exact-match accuracy. However, it is not efficientfor non-exact-match queries. In this paper, we presentsome techniques for supporting range queries and partialkeyword search on top of DHT schemes.