Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

  • Authors:

  • Rimantas Benetis;Christian S. Jensen;Gytis Karciauskas;Simonas Saltenis

  • Affiliations:

  • -;-;-;-

  • Venue:
  • IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While algorithms have been proposed that compute RNN queries fornon-moving objects, there have been no proposals for answering RNN queries for continuously moving objects. Another such query is the nearest neighbor (NN) query, which has been studied extensively and in many contexts. Like the RNN query, the NN query has not been explored for moving query and data points.This paper proposes an algorithm for answering RNN queries for continuously moving points in the plane. As a part of the solution to this problem and as a separate contribution, an algorithm for answering NN queries for continuously moving points is also proposed. The results of performance experiments are reported.