A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. DHT-based scheme improves the scalability and exact-match accuracy. However, it is not efficient for non-exact-match queries. In this paper, we present some techniques for supporting range queries and partial keyword search on top of DHT schemes.
Citation:
Ming Zhang, Kian-Lee Tan, "Supporting Rich Queries in DHT-based Peer-to-Peer Systems," wetice, pp.95, Twelfth International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2003