Issue No. 12 - December (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.91
Yue Wang , Sch. of Comput. Sci., Fudan Univ., Shanghai, China
Wang-Chien Lee , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
Dingxiong Deng , Sch. of Comput. Sci., Fudan Univ., Shanghai, China
Shuigeng Zhou , Shanghai Key Lab. of Intell. Infromation Process., Fudan Univ., Shanghai, China
Jianliang Xu , Dept. of Comput. Sci., Hong Kong Baptist Univ., Kowloon Tong, China
Yuzhe Tang , Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA
In this paper, we study the problem of indexing multidimensional data in P2P networks based on distributed hash tables (DHTs). We advocate the indexing approach that superimposes a multidimensional index tree on top of a DHT - a paradigm that keeps the underlying DHT intact while being able to adapt to any DHT substrate. In this context, we identify several index design issues and propose a novel indexing scheme called multidimensional Lightweight Hash Tree (m-LIGHT). First, to preserve data locality, m-LIGHT employs a clever naming mechanism that gracefully maps a tree-based index into the DHT and contributes to high efficiency in both index maintenance and query processing. Second, to tackle the load balancing issue, m-LIGHT leverages a new data-aware splitting strategy that achieves optimal load balance under a fixed index size. We present detailed algorithms for processing complex queries over the m-LIGHT index. We also conduct an extensive performance evaluation of m-LIGHT in comparison with several state-of-the-art indexing schemes. The experimental results show that m-LIGHT substantially reduces index maintenance overhead and improves query performance in terms of both bandwidth consumption and response latency.
tree data structures, file organisation, indexing, peer-to-peer computing, query processing, resource allocation, bandwidth consumption, DHT, multidimensional data indexing approach, P2P networks, distributed hash tables, multidimensional lightweight hash tree, data locality, query processing, load balancing issue, data-aware splitting strategy, index maintenance, Peer to peer computing, Maintenance engineering, Query processing, Indexing, Distributed databases, k-NN queries., P2P systems, distributed hash tables, multi-dimensional indexing, range queries
Yue Wang, Wang-Chien Lee, Dingxiong Deng, Shuigeng Zhou, Jianliang Xu and Yuzhe Tang, "A Lightweight Multidimensional Index for Complex Queries over DHTs," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 2046-2054, 2011.