DHR-Trees: Enabling Multidimensional Queries in P2P Systems
Summary :
There is an increasing requirement for supporting complex multidimensional queries in Peer-to-Peer systems. In the centralized spatial database world, R-Trees and its variant structures are widely accepted due to their capabilities to manage complex multidimensional queries. In this paper, we propose a new multidimensional indexing structure for P2P systems, called Distributed Hilbert R-Trees (DHR-Trees), in which peers organize themselves into an overlay network, dynamically maintain routing tables with region information and collaboratively execute complex multidimensional queries, such as range query and k-nearest neighbors query, efficiently. DHR-Trees has similar topology to the P-Trees P2P system. The peers' routing tables are enhanced with spatial region information, which allow multidimensional query predicates to be adapted into P2P systems with minor modification. The structure design and two major multidimensional query algorithms are presented. Our experimental results demonstrate that it performs well on range queries and k-nearest neighbors queries with multidimensional data set.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.9 pp.2494-2503
- Publication Date
- 2007/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.9.2494
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Xinfa WEI, Kaoru SEZAKI, "DHR-Trees: Enabling Multidimensional Queries in P2P Systems" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 9, pp. 2494-2503, September 2007, doi: 10.1093/ietcom/e90-b.9.2494.
Abstract: There is an increasing requirement for supporting complex multidimensional queries in Peer-to-Peer systems. In the centralized spatial database world, R-Trees and its variant structures are widely accepted due to their capabilities to manage complex multidimensional queries. In this paper, we propose a new multidimensional indexing structure for P2P systems, called Distributed Hilbert R-Trees (DHR-Trees), in which peers organize themselves into an overlay network, dynamically maintain routing tables with region information and collaboratively execute complex multidimensional queries, such as range query and k-nearest neighbors query, efficiently. DHR-Trees has similar topology to the P-Trees P2P system. The peers' routing tables are enhanced with spatial region information, which allow multidimensional query predicates to be adapted into P2P systems with minor modification. The structure design and two major multidimensional query algorithms are presented. Our experimental results demonstrate that it performs well on range queries and k-nearest neighbors queries with multidimensional data set.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.9.2494/_p
Copy
@ARTICLE{e90-b_9_2494,
author={Xinfa WEI, Kaoru SEZAKI, },
journal={IEICE TRANSACTIONS on Communications},
title={DHR-Trees: Enabling Multidimensional Queries in P2P Systems},
year={2007},
volume={E90-B},
number={9},
pages={2494-2503},
abstract={There is an increasing requirement for supporting complex multidimensional queries in Peer-to-Peer systems. In the centralized spatial database world, R-Trees and its variant structures are widely accepted due to their capabilities to manage complex multidimensional queries. In this paper, we propose a new multidimensional indexing structure for P2P systems, called Distributed Hilbert R-Trees (DHR-Trees), in which peers organize themselves into an overlay network, dynamically maintain routing tables with region information and collaboratively execute complex multidimensional queries, such as range query and k-nearest neighbors query, efficiently. DHR-Trees has similar topology to the P-Trees P2P system. The peers' routing tables are enhanced with spatial region information, which allow multidimensional query predicates to be adapted into P2P systems with minor modification. The structure design and two major multidimensional query algorithms are presented. Our experimental results demonstrate that it performs well on range queries and k-nearest neighbors queries with multidimensional data set.},
keywords={},
doi={10.1093/ietcom/e90-b.9.2494},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - DHR-Trees: Enabling Multidimensional Queries in P2P Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 2494
EP - 2503
AU - Xinfa WEI
AU - Kaoru SEZAKI
PY - 2007
DO - 10.1093/ietcom/e90-b.9.2494
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2007
AB - There is an increasing requirement for supporting complex multidimensional queries in Peer-to-Peer systems. In the centralized spatial database world, R-Trees and its variant structures are widely accepted due to their capabilities to manage complex multidimensional queries. In this paper, we propose a new multidimensional indexing structure for P2P systems, called Distributed Hilbert R-Trees (DHR-Trees), in which peers organize themselves into an overlay network, dynamically maintain routing tables with region information and collaboratively execute complex multidimensional queries, such as range query and k-nearest neighbors query, efficiently. DHR-Trees has similar topology to the P-Trees P2P system. The peers' routing tables are enhanced with spatial region information, which allow multidimensional query predicates to be adapted into P2P systems with minor modification. The structure design and two major multidimensional query algorithms are presented. Our experimental results demonstrate that it performs well on range queries and k-nearest neighbors queries with multidimensional data set.
ER -
English
