Nearest Neighbor Search on Moving Object Trajectories

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 branch-and-bound algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (continuous or not). We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on a member of the R-tree family for trajectory data (the TB-tree), we demonstrate their scalability and efficiency through an extensive experimental study using synthetic and real datasets.

[1]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[2]  Ada Wai-Chee Fu,et al.  Enhanced nearest neighbour search on the R-tree , 1998, SGMD.

[3]  Yannis Manolopoulos,et al.  R-Trees: Theory and Applications , 2005, Advanced Information and Knowledge Processing.

[4]  Christian S. Jensen,et al.  Lopez: "Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD 2000.

[5]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[6]  Christian S. Jensen,et al.  Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD Conference.

[7]  Max J. Egenhofer,et al.  Advances in Spatial Databases , 1997, Lecture Notes in Computer Science.

[8]  Yannis Theodoridis,et al.  On the Generation of Spatiotemporal Datasets , 1999 .

[9]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[10]  Jimeng Sun,et al.  Analysis of predictive spatio-temporal queries , 2003, TODS.

[11]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.

[12]  Yufei Tao,et al.  Time-parameterized queries in spatio-temporal databases , 2002, SIGMOD '02.

[13]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[14]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

[15]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2003, GeoInformatica.

[16]  Hanan Samet,et al.  Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates , 2003, VLDB.

[17]  Timos K. Sellis,et al.  Spatio-temporal composition and indexing for large multimedia applications , 1998, Multimedia Systems.

[18]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[19]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.