Continuous nearest neighbor search

  • Authors:

  • Yufei Tao;Dimitris Papadias;Qiongmao Shen

  • Affiliations:

  • Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong;Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

  • Venue:
  • VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A continuous nearest neighbor query retrieves the nearestneighbor (NN) of every point on a line segment (e.g., "find all mynearest gas stations during my route from points to pointe. The result contains a set of (point, interval) tuples,such that point is the NN of all points in the correspondinginterval. Existing methods for continuous nearest neighbor searchare based on the repetitive application of simple NN algorithms,which incurs significant overhead. In this paper we proposetechniques that solve the problem by performing a single query forthe whole input segment. As a result the cost, depending on thequery and dataset characteristics, may drop by orders of magnitude.In addition, we propose analytical models for the expected size ofthe output, as well as, the cost of query processing, and extendout techniques to several variations of the problem.