Supporting rich queries in DHT-based peer-to-peer systems

A fundamental problem that confronts peer-to-peer (P2P) applications is to efficiently locate the node that stores a particular data item. DHT-based (distributed hash table) 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.