Supporting range query 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(DHRTrees). DHR-Trees enables multidimensional range query to be executed similarly as in overlapping regions tree. It’s distributed structures make it fault-rolerant 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.