VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes

H. V. Jagadish; Beng Chin Ooi; Quang Hieu Vu; Kong Zhang; Aoying Zhou

doi:10.1109/ICDE.2006.169

VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes

H. V. Jagadish^*
, Beng Chin Ooi
, Quang Hieu Vu
, Kong Zhang
, Aoying Zhou

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

131 Scopus citations

Abstract

Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal.

Original language	English
Title of host publication	Proceedings of the 22nd International Conference on Data Engineering, ICDE '06
Publisher	IEEE Computer Society
Pages	25-34
Number of pages	10
ISBN (Print)	0769525709, 9780769525709
DOIs	https://doi.org/10.1109/ICDE.2006.169
State	Published - 2006
Externally published	Yes
Event	22nd International Conference on Data Engineering, ICDE '06 - Atlanta, GA, United States Duration: 3 Apr 2006 → 7 Apr 2006

Publication series

Name	Proceedings - International Conference on Data Engineering
Volume	2006
ISSN (Print)	1084-4627

Conference

Conference	22nd International Conference on Data Engineering, ICDE '06
Country/Territory	United States
City	Atlanta, GA
Period	3/04/06 → 7/04/06

Access to Document

10.1109/ICDE.2006.169

Cite this

Jagadish, H. V., Ooi, B. C., Vu, Q. H., Zhang, K., & Zhou, A. (2006). VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. In Proceedings of the 22nd International Conference on Data Engineering, ICDE '06 (pp. 25-34). Article 1617402 (Proceedings - International Conference on Data Engineering; Vol. 2006). IEEE Computer Society. https://doi.org/10.1109/ICDE.2006.169

@inproceedings{240e560577164394ab9fb7d3975433b9,

title = "VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes",

abstract = "Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal.",

author = "Jagadish, \{H. V.\} and Ooi, \{Beng Chin\} and Vu, \{Quang Hieu\} and Kong Zhang and Aoying Zhou",

year = "2006",

doi = "10.1109/ICDE.2006.169",

language = "英语",

isbn = "0769525709",

series = "Proceedings - International Conference on Data Engineering",

publisher = "IEEE Computer Society",

pages = "25--34",

booktitle = "Proceedings of the 22nd International Conference on Data Engineering, ICDE '06",

address = "美国",

note = "22nd International Conference on Data Engineering, ICDE '06 ; Conference date: 03-04-2006 Through 07-04-2006",

}

Jagadish, HV, Ooi, BC, Vu, QH, Zhang, K & Zhou, A 2006, VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. in Proceedings of the 22nd International Conference on Data Engineering, ICDE '06., 1617402, Proceedings - International Conference on Data Engineering, vol. 2006, IEEE Computer Society, pp. 25-34, 22nd International Conference on Data Engineering, ICDE '06, Atlanta, GA, United States, 3/04/06. https://doi.org/10.1109/ICDE.2006.169

VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. / Jagadish, H. V.; Ooi, Beng Chin; Vu, Quang Hieu et al.
Proceedings of the 22nd International Conference on Data Engineering, ICDE '06. IEEE Computer Society, 2006. p. 25-34 1617402 (Proceedings - International Conference on Data Engineering; Vol. 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - VBI-Tree

T2 - 22nd International Conference on Data Engineering, ICDE '06

AU - Jagadish, H. V.

AU - Ooi, Beng Chin

AU - Vu, Quang Hieu

AU - Zhang, Kong

AU - Zhou, Aoying

PY - 2006

Y1 - 2006

N2 - Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal.

AB - Multi-dimensional data indexing has received much attention in a centralized database. However, not so much work has been done on this topic in the context of Peer-to-Peer systems. In this paper, we propose a new Peer-to-Peer framework based on a balanced tree structure overlay, which can support extensible centralized mapping methods and query processing based on a variety of multidimensional tree structures, including R-Tree, X-Tree, SS-Tree, and M-Tree. Specifically, in a network with N nodes, our framework guarantees that point queries and range queries can be answered within O(logN) hops. We also provide an effective load balancing strategy to allow nodes to balance their work load efficiently. An experimental assessment validates the practicality of our proposal.

UR - https://www.scopus.com/pages/publications/33749626994

U2 - 10.1109/ICDE.2006.169

DO - 10.1109/ICDE.2006.169

M3 - 会议稿件

AN - SCOPUS:33749626994

SN - 0769525709

SN - 9780769525709

T3 - Proceedings - International Conference on Data Engineering

SP - 25

EP - 34

BT - Proceedings of the 22nd International Conference on Data Engineering, ICDE '06

PB - IEEE Computer Society

Y2 - 3 April 2006 through 7 April 2006

ER -

VBI-Tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this