Abstract
With the proliferation of mobile devices, massive trajectory data has been generated. Searching trajectories by locations is one of fundamental tasks. Previous work such as [3, 6, 9] has been proposed to answer the search. Such work typically measures the distance between trajectories and queries by the distance between query points and GPS points of trajectories. Such measurement could be inaccurate because those GPS points generated by some sampling rate are essentially discrete. To overcome this issue, we treat a trajectory as a sequence of line segments and compute the distance between a query point and a trajectory by the one between the query point and line segments. Next, we index the line segments by R-tree and match each trajectory to the associated line segments by inverted lists. After that, we propose a k-nearest neighbor (KNN) search algorithm on the indexing structure. Moreover, we propose to cluster line segments and merge redundant trajectory IDs for higher efficiency. Experimental results validate that the proposed method significantly outperforms existing approaches in terms of saving storage cost of data and the query performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
https://www.kaggle.com/c/pkdd-15-predict-taxi-service-trajectory-i
Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 69–84. Springer, Heidelberg (1993). doi:10.1007/3-540-57301-1_5
Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 255–266. ACM, New York (2010)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, SIGMOD 1984, pp. 47–57. ACM, New York (1984)
Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604–613. ACM, New York (1998)
Qi, S., Bouros, P., Sacharidis, D., Mamoulis, N.: Efficient point-based trajectory search. In: Claramunt, C., Schneider, M., Wong, R.C.-W., Xiong, L., Loh, W.-K., Shahabi, C., Li, K.-J. (eds.) SSTD 2015. LNCS, vol. 9239, pp. 179–196. Springer, Cham (2015). doi:10.1007/978-3-319-22363-6_10
Song, J., Gao, L., Liu, L., Zhu, X., Sebe, N.: Quantization-based hashing: a general framework for scalable image and video retrieval. Pattern Recognit. (2017)
Song, R., Sun, W., Zheng, B., Zheng, Y.: PRESS: a novel framework of trajectory compression in road networks. Proc. VLDB Endow. 7(9), 661–672 (2014)
Tang, L.-A., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J.: Retrieving k-nearest neighboring trajectories by a set of point locations. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 223–241. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22922-0_14
Vlachos, M., Kollios, G., Gunopulos, D.: Discovering similar multidimensional trajectories. In: Proceedings 18th International Conference on Data Engineering, pp. 673–684 (2002)
Wang, J., Zhang, T., Sebe, N., Shen, H.T.: A survey on learning to hash. IEEE Trans. Pattern Anal. Mach. Intell. PP(99), 1 (2017)
Zheng, Y.: Trajectory data mining: an overview. ACM Trans. Intell. Syst. Technol. 6(3), 29:1–29:41 (2015)
Acknowledgment
This work is partially sponsored by National Natural Science Foundation of China (Grant No. 61572365, 61503286), Science and Technology Commission of Shanghai Municipality (Grant No. 14DZ1118700, 15ZR1443000, 15YF1412600) and Huawei Innovation Research Program (HIRP).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Yuan, P., Zhao, Q., Rao, W., Yuan, M., Zeng, J. (2017). Searching k-Nearest Neighbor Trajectories on Road Networks. In: Huang, Z., Xiao, X., Cao, X. (eds) Databases Theory and Applications. ADC 2017. Lecture Notes in Computer Science(), vol 10538. Springer, Cham. https://doi.org/10.1007/978-3-319-68155-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-68155-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68154-2
Online ISBN: 978-3-319-68155-9
eBook Packages: Computer ScienceComputer Science (R0)