Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Nearest Neighbor Search on Moving Object Trajectories. In: Anshelevich, E., Egenhofer, M.J., Hwang, J. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 328–345. Springer, Heidelberg (2005)
Papadias, D., Tao, Y., Mouratidis, K., Hui, K.: Aggregate Nearest Neighbor Queries in Spatial Databases. ACM TODS 30(2), 529–576
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM TODS 24(2), 265–318 (1999)
GeoLife GPS Trajectories Datasets. Released at, http://research.microsoft.com/en-us/downloads/b16d359d-d164-469e-9fd4-daa38f2b2e13/default.aspx
Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-Drive: Driving Directions Based on Taxi Trajectories. In: ACM SIGSPATIAL GIS (2010)
Chen, L., Ng, R.: On the marriage of lp-norms and edit distance. In: VLDB (2004)
Tang, L., Yu, X., Kim, S., Han, J., et al.: Tru-Alarm: Trustworthiness Analysis of Sensor Networks in Cyber-Physical Systems. In: ICDM (2010)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD (1995)
Fagin, R.: Combining fuzzy information from multiple systems. J. Comput. System Sci. 58, 83–89 (1999)
Sherkat, R., Rafiei, D.: On efficiently searching trajectories and archival data for historical similarities. In: PVLDB (2008)
Fagin, R., Lotem, A.: Optimal aggregation algorithms for middleware. In: PODS (2001)
Zheng, V.W., Zheng, Y., Xie, X., Yang, Q.: Collaborative location and activity recommendations with GPS history data. In: WWW (2010)
Zheng, Y., Zhang, L., Xie, X., Ma, W.Y.: Mining interesting locations and travel sequences from GPS trajectories. In: WWW (2009)
Zheng, Y., Wang, L., Xie, X., Ma, W.Y.: GeoLife: Managing and understanding your past life over maps. In: MDM (2008)
Zheng, Y., Xie, X., Ma, W.Y.: GeoLife: A Collaborative Social Networking Service among User, location and trajectory. IEEE Data Engineering Bulletin 33(2), 32–40
Zheng, Y., Chen, Y., Xie, X., Ma, W.Y.: GeoLife2.0: A Location-Based Social Networking Service. In: MDM (2009)
Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: SIGMOD (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, LA., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J. (2011). Retrieving k-Nearest Neighboring Trajectories by a Set of Point Locations. In: Pfoser, D., et al. Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22922-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-22922-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22921-3
Online ISBN: 978-3-642-22922-0
eBook Packages: Computer ScienceComputer Science (R0)