Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06) DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems Timisoara, Romania July 06-July 09 ISBN: 0-7695-2638-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPDC.2006.19
Supporting range query over Peer-to-Peer systems has attracted many research efforts in recent years. In this paper, we propose a new multidimensional indexing structure for P2P systems called Distributed Hilbert R-trees (DHRtrees). DHR-trees enables multidimensional range query to be executed similarly as in overlapping regions tree in P2P systems. Its distributed structure makes it fault-tolerant and scalable to dynamic network environment with a large number of peers as well. Our experiments shows that it performs well on multidimensional range query while the maintenance cost is reasonably low.
Citation:
Xinfa Wei, Kaoru Sezaki, "DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems," ispdc, pp.281-290, Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb