Presentation 2006-05-18
DHR-Trees : A Distributed Multidimensional Indexing Structure for P2P Systems
Xinfa WEI, Kaoru SEZAKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Supporting complex queries over Peer-to-Peer systems has attracted many research efforts in recent years. In this paper, we propose a new multidimentional indexing structure for P2P systems called Distributed Hilbert R-Trees (DHR-Trees). DHR-Trees enables multidimensional range query and k-nearest neighbor query to be executed similarly as in overlapping regions tree. Its distributed structures make it fault-tolerant and scalable to a large number of peers. Our experiments shows that it performs well on multidimensional range query while the maintenance cost is reasonably low.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Peer-to-Peer systems / Multidimensional range query / K-nearest neighbor query / Hilbert R-Trees / Spatial database dimensional range queries
Paper # NS2006-22
Date of Issue

Conference Information
Committee NS
Conference Date 2006/5/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) DHR-Trees : A Distributed Multidimensional Indexing Structure for P2P Systems
Sub Title (in English)
Keyword(1) Peer-to-Peer systems
Keyword(2) Multidimensional range query
Keyword(3) K-nearest neighbor query
Keyword(4) Hilbert R-Trees
Keyword(5) Spatial database dimensional range queries
1st Author's Name Xinfa WEI
1st Author's Affiliation Graduate School of Information Science and Technology, The University of Tokyo()
2nd Author's Name Kaoru SEZAKI
2nd Author's Affiliation Institute of Industrial Science (IIS), The University of Tokyo
Date 2006-05-18
Paper # NS2006-22
Volume (vol) vol.106
Number (no) 41
Page pp.pp.-
#Pages 4
Date of Issue