P2P spatial query processing by delaunay triangulation

  • Authors:
  • Hye-Young Kang;Bog-Ja Lim;Ki-Joune Li

  • Affiliations:
  • Department of Computer Science and Engineering, Pusan National University, Pusan, South Korea;Department of Computer Science and Engineering, Pusan National University, Pusan, South Korea;Department of Computer Science and Engineering, Pusan National University, Pusan, South Korea

  • Venue:
  • W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.