A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Efficient k-nearest neighbor search on moving object trajectories
2010
The VLDB journal
With the growing number of mobile applications, data analysis on large sets of historical moving objects trajectories becomes increasingly important. Nearest neighbor search is a fundamental problem in spatial and spatio-temporal databases. In this paper we consider the following problem: Given a set of moving object trajectories D and a query trajectory mq, find the k nearest neighbors to mq within D for any instant of time within the life time of mq. We assume D is indexed in a 3D-R-tree and
doi:10.1007/s00778-010-0185-7
fatcat:ne2htenb55cm5jaspmabe6ifyi