Continuous K-nearest neighbor queries for continuously moving points with updates

  • Authors:

  • Glenn S. Iwerks;Hanan Samet;Ken Smith

  • Affiliations:

  • The MITRE Corporation, McLean, Virginia and Computer Science Department, Center for Automation Research and Institute for Advanced Computer Studies, University of Maryland at College Park;Computer Science Department, Center for Automation Research and Institute for Advanced Computer Studies, University of Maryland at College Park;The MITRE Corporation, McLean, Virginia

  • Venue:
  • VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years there has been an increasing interest in databases of moving objects where the motion and extent of objects are represented as a function of time. The focus of this paper is on the maintenance of continuous K- nearest neighbor (k-NN) queries on moving points when updates are allowed. Updates change the functions describing the motion of the points, causing pending events to change. Events are processed to keep the query result consistent as points move. It is shown that the cost of maintaining a continuous k-NN query result for moving points represented in this way can be significantly reduced with a modest increase in the number of events processed in the presence of updates. This is achieved by introducing a continuous within query to filter the number of objects that must be taken into account when maintaining a continuous k-NN query. This new approach is presented and compared with other recent work. Experimental results are presented showing the utility of this approach.