P2P Spatial Query Processing by Delaunay Triangulation

Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has been paid on spatial query process. In this paper, we propose a triangular topology of P2P network and spatial query processing methods on this topology. Each node maintains a set of pointers to neighbor nodes determined by delaunay triangulation. This triangular network topology provides us with an efficient way to find a path from any source node to the destination node or area, and to process spatial queries. We compare two spatial query processing methods based on the triangular network by experiments.