Algorithms for Nearest Neighbor Search on Moving Object Trajectories

  • Authors:

  • Elias Frentzos;Kostas Gratsias;Nikos Pelekis;Yannis Theodoridis

  • Affiliations:

  • Information Systems Laboratory, Department of Informatics, University of Piraeus, Piraeus, Greece 18534;Information Systems Laboratory, Department of Informatics, University of Piraeus, Piraeus, Greece 18534 and Data and Knowledge Engineering Group, R. A. Computer Technology Institute, Patras, Greec ...;Information Systems Laboratory, Department of Informatics, University of Piraeus, Piraeus, Greece 18534;Information Systems Laboratory, Department of Informatics, University of Piraeus, Piraeus, Greece 18534 and Data and Knowledge Engineering Group, R. A. Computer Technology Institute, Patras, Greec ...

  • Venue:
  • Geoinformatica
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far deals with either stationary or moving query points over static datasets or future (predicted) locations over a set of continuously moving points. With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed (depth-first and best-first) algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (historical continuous or not), thus resulting in four types of NN queries. We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on two members of the R-tree family for trajectory data (namely, the TB-tree and the 3D-R-tree), we demonstrate their scalability and efficiency through an extensive experimental study using large synthetic and real datasets.