A grid structure support multi-dimensional range query for P2P networks

There are two problems for supporting multi-dimensional range query in p2p overlay networks, the first is to preserve data locality in the process of data space partitioning ,and the second is the maintenance of data locality among data ranges with an exponentially expanding and extending rate, the first problem has been well addressed by using recursive decomposition schemes, such as Quad-tree, k-d tree, Z-order, and Hilbert curve, for the second problem ,in this paper , we propose a grid structure p2p which can easily maintain data locality ,and can efficiently support range query.