DHR-Trees: A Distributed Multidimensional Indexing Structure for P2P Systems
Abstract
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 (DHR-trees). 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.Downloads
Download data is not yet available.
Downloads
Published
2001-03-01
Issue
Section
Proposal for Special Issue Papers