SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
GeoLife: Managing and Understanding Your Past Life over Maps
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Mining interesting locations and travel sequences from GPS trajectories
Proceedings of the 18th international conference on World wide web
GeoLife2.0: A Location-Based Social Networking Service
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Collaborative location and activity recommendations with GPS history data
Proceedings of the 19th international conference on World wide web
Searching trajectories by locations: an efficiency study
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
T-drive: driving directions based on taxi trajectories
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Tru-Alarm: Trustworthiness Analysis of Sensor Networks in Cyber-Physical Systems
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Nearest neighbor search on moving object trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Exploiting large-scale check-in data to recommend time-sensitive routes
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
A ranking measure for top-k moving object trajectories search
Proceedings of the 7th Workshop on Geographic Information Retrieval
A framework of traveling companion discovery on trajectory data streams
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.00 |
The advance of object tracking technologies leads to huge volumes of spatio-temporal data accumulated in the form of location trajectories. Such data bring us new opportunities and challenges in efficient trajectory retrieval. In this paper, we study a new type of query that finds the k Nearest Neighboring Trajectories (k-NNT) with the minimum aggregated distance to a set of query points. Such queries, though have a broad range of applications like trip planning and moving object study, cannot be handled by traditional k-NN query processing techniques that only find the neighboring points of an object. To facilitate scalable, flexible and effective query execution, we propose a k-NN trajectory retrieval algorithm using a candidate-generation-and-verification strategy. The algorithm utilizes a data structure called global heap to retrieve candidate trajectories near each individual query point. Then, at the verification step, it refines these trajectory candidates by a lower-bound computed based on the global heap. The global heap guarantees the candidate's completeness (i.e., all the k-NNTs are included), and reduces the computational overhead of candidate verification. In addition, we propose a qualifier expectation measure that ranks partial-matching candidate trajectories to accelerate query processing in the cases of non-uniform trajectory distributions or outlier query locations. Extensive experiments on both real and synthetic trajectory datasets demonstrate the feasibility and effectiveness of proposed methods.