A lightweight multidimensional index for complex queries over DHTs

Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-chien Lee, Dingxiong Deng, Yue Wang

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

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 DHTa 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.

Original languageEnglish (US)
Article number5733347
Pages (from-to)2046-2054
Number of pages9
JournalIEEE Transactions on Parallel and Distributed Systems
Volume22
Issue number12
DOIs
StatePublished - Oct 7 2011

Fingerprint

Query processing
Resource allocation
Bandwidth
Substrates
Processing

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Tang, Yuzhe ; Xu, Jianliang ; Zhou, Shuigeng ; Lee, Wang-chien ; Deng, Dingxiong ; Wang, Yue. / A lightweight multidimensional index for complex queries over DHTs. In: IEEE Transactions on Parallel and Distributed Systems. 2011 ; Vol. 22, No. 12. pp. 2046-2054.
@article{95f3b4fe8f5d4e81be62ab6f8ed701bd,
title = "A lightweight multidimensional index for complex queries over DHTs",
abstract = "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 DHTa 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.",
author = "Yuzhe Tang and Jianliang Xu and Shuigeng Zhou and Wang-chien Lee and Dingxiong Deng and Yue Wang",
year = "2011",
month = "10",
day = "7",
doi = "10.1109/TPDS.2011.91",
language = "English (US)",
volume = "22",
pages = "2046--2054",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "12",

}

A lightweight multidimensional index for complex queries over DHTs. / Tang, Yuzhe; Xu, Jianliang; Zhou, Shuigeng; Lee, Wang-chien; Deng, Dingxiong; Wang, Yue.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 22, No. 12, 5733347, 07.10.2011, p. 2046-2054.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A lightweight multidimensional index for complex queries over DHTs

AU - Tang, Yuzhe

AU - Xu, Jianliang

AU - Zhou, Shuigeng

AU - Lee, Wang-chien

AU - Deng, Dingxiong

AU - Wang, Yue

PY - 2011/10/7

Y1 - 2011/10/7

N2 - 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 DHTa 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.

AB - 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 DHTa 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.

UR - http://www.scopus.com/inward/record.url?scp=80055031427&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80055031427&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2011.91

DO - 10.1109/TPDS.2011.91

M3 - Article

VL - 22

SP - 2046

EP - 2054

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 12

M1 - 5733347

ER -