Fast Nearest-Neighbor Query Processing in Moving-Object Databases

  • Authors:

  • K. Raptopoulou;A. N. Papadopoulos;Y. Manolopoulos

  • Affiliations:

  • Department of Informatics, Aristotle University, Thessaloniki 54006, Greece katerina@delab.csd.auth.gr;Department of Informatics, Aristotle University, Thessaloniki 54006, Greece apostol@delab.csd.auth.gr;Department of Informatics, Aristotle University, Thessaloniki 54006, Greece manolopo@delab.csd.auth.gr

  • Venue:
  • Geoinformatica
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change positions continuously, and therefore we can not rely on a given fixed reference position to determine the answer. Existing techniques are either based on sampling, or on repetitive application of time-parameterized queries in order to provide the answer. In this paper we develop an efficient method in order to process nearest-neighbor queries in moving-object databases. The basic advantage of the proposed approach is that only one query is issued per time interval. The time-parameterized R-tree structure is used to index the moving objects. An extensive performance evaluation, based on CPU and I/O time, shows that significant improvements are achieved compared to existing techniques.