Supporting rich queries in DHT-based peer-to-peer systems
Ming Zhang, Kian‐Lee Tan
Abstract
Ming Zhang, Kian‐Lee Tan
Abstract
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.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Distributed hash table, Computer science, Scalability, Peer-to-peer, Hash table, Hash function, Node (physics), Scheme (mathematics)