Nearest Neighbor Search on Moving Object Trajectories

• Published in: Advances in Spatial and Temporal Databases pp. 328 - 345
• Main Authors: Frentzos, Elias, Gratsias, Kostas, Pelekis, Nikos, Theodoridis, Yannis
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Applied sciences; Computer science; control theory; systems; Continuous Counterpart; Exact sciences and technology; Information systems. Data bases; Memory organisation. Data processing; Node Access; Pruning Strategy; Query Object; Query Point; Software; Nearest neighbour; Data analysis; Search strategy; Tree structured method; Scalability; Database query; Branch and bound method; Data processing; R tree; Stationary condition; Query processing; Ordering; Wireless network; Metric; Search tree; Trajectory; Localization; Information structure; Moving body; Mobile computing; Spatial database
• ISBN: 3540281274; 9783540281276
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11535331_19

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.