Sciweavers

Share
GEOINFORMATICA
2007

Algorithms for Nearest Neighbor Search on Moving Object Trajectories

8 years 11 months ago
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
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 sup...
Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Ya
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2007
Where GEOINFORMATICA
Authors Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Yannis Theodoridis
Comments (0)
books