Abstract
In this paper, we propose an efficient query processing algorithm that returns the trajectory results in a progressive manner. We limit the calculation of pairwise shortest path distances between the set of query locations and the spatial nodes, by highly reducing the preprocessing requirements. Also, we introduce a spatiotemporal similarity measure, based on which the temporal-to-spatial significance of the trajectory results can be easily modified and the query locations can be spatially prioritized according to users’ preferences. In our experiments with a real-world road network, we show that the proposed method has approximately ten times less preprocessing requirements than the competitive methods and reduces the search time by two orders of magnitude at least.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Multiset is a generalization of the notion of set in which members are allowed to appear more than once.
- 2.
- 3.
Real Datasets for Spatial Databases: http://www.cs.utah.edu/~lifeifei/SpatialDataset.htm
References
Brinkhoff, T.: A framework for generating network-based moving objects. Geoinformatica 6(2), 153–180 (2002)
Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 255–266 (2010)
Shang, S., Ding, R., Yuan, B., Xie, K., Zheng, K., Kalnis, P.: User oriented trajectory search for trip recommendation. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 156–167 (2012)
Shang, S., Ding, R., Zheng, K., Jensen, C.S., Kalnis, P., Zhou, X.: Personalized trajectory matching in spatial networks. VLDB J. 23(3), 449–468 (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)
Wang, H., Liu, K.: User Oriented Trajectory Similarity Search. In: Proceedings of the ACM SIGKDD International Workshop on Urban, Computing, pp. 103–110 (2012)
Zheng, K., Trajcevski, G., Zhou, X., Scheuermann, P.: Probabilistic range queries for uncertain trajectories on road networks. In: Proceedings of the 14th International Conference on Extending Database Technology, pp. 283–294 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Tiakas, E., Rafailidis, D. (2015). Scalable Trajectory Similarity Search Based on Locations in Spatial Networks. In: Bellatreche, L., Manolopoulos, Y. (eds) Model and Data Engineering. Lecture Notes in Computer Science(), vol 9344. Springer, Cham. https://doi.org/10.1007/978-3-319-23781-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-23781-7_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23780-0
Online ISBN: 978-3-319-23781-7
eBook Packages: Computer ScienceComputer Science (R0)