LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs

Distributed Hash Table (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.

Provided by: Institute of Electrical & Electronic Engineers Topic: Big Data Date Added: Jan 2010 Format: PDF

Find By Topic