This paper introduces a common architecture of the multi-dimensiona1 data range queries based on the P2P network and constructs a virtual hierarchical tree based on space division which ensures that the exploration of the relevant query regions occurred between the nodes in the same layer as far as possible. Thereby the query burden of the upper node will be reduced and the bottlenecks of the root node can be avoided which will reduce the updating cost effectively. Through the simulations the method has been proved to be effective.