DHR-Trees: Enabling Multidimensional Queries in P2P Systems

Xinfa WEI
Kaoru SEZAKI

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B    No.9    pp.2494-2503
Publication Date: 2007/09/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.9.2494
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
Keyword: 
Peer-to-Peer systems,  multidimensional queries,  Hilbert R-Trees,  

Full Text: PDF(935.8KB)>>
Buy this Article


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.