Department of Computer Science
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queries (e.g., range queries and k-nearest-neighbor queries) in DHT-based P2P systems. In order to support efficient processing of such complex queries, a popular solution is to build indexes on top of the DHT. Unfortunately, existing over-DHT indexing schemes suffer from either query inefficiency or high maintenance cost. In this paper, we propose LIGhtweight Hash Tree (LIGHT)—a query-efficient yet low-maintenance indexing scheme. LIGHT employs a novel naming mechanism and a tree summarization strategy for graceful distribution of its index structure. We show through analysis that it can support various complex queries with near-optimal performance. Extensive experimental results also demonstrate that, compared with state of the art over-DHT indexing schemes, LIGHT saves 50-75 percent of index maintenance cost and substantially improves query performance in terms of both response time and bandwidth consumption. In addition, LIGHT is designed over generic DHTs and hence can be easily implemented and deployed in any DHT-based P2P system.
Distributed hash tables, indexing, complex queries
Source Publication Title
IEEE Transactions on Knowledge and Data Engineering
IEEE Computer Society
Link to Publisher's Edition
Tang, Y., Zhou, S., & Xu, J. (2010). LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs. IEEE Transactions on Knowledge and Data Engineering, 22 (1). https://doi.org/10.1109/TKDE.2009.47