Abstract
The volume of trajectory data has become tremendously large in recent years. How to effectively and efficiently search similar trajectories has become an important task. Firstly, to measure the similarity between a trajectory and a query, literature works compute spatial similarity and temporal similarity independently, and next sum the two weighted similarities. Thus, two trajectories with high spatial similarity and low temporal similarity will have the same overall similarity with another two trajectories with low spatial similarity and high temporal similarity. To overcome this issue, we propose to measure the similarity by synchronously matching the spatial distance against temporal distance. Secondly, given this new similarity measurement, to overcome the challenge of searching top-k similar trajectories over a huge trajectory database with non-trivial number of query points, we propose to efficiently answer the top-k similarity search by following two techniques: trajectory database grid indexing and query partitioning. The performance of our proposed algorithms is studied in extensive experiments based on two real data sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Zhao K, Musolesi M, Hui P, Rao W, Tarkoma S (2015) Explaining the power-law distribution of human mobility through transportationmodality decomposition. Sci Pep 5(1):1–7
de Berg M, Cheong O, van Kreveld MJ, Overmars MH (2008) Computational geometry: algorithms and applications, 3rd edn. Springer
Das G, Gunopulos D, Mannila H (1997) Finding similar time series. In: PKDD 97, pp 88–100
Ranu S, Deepak P, Telang AD, Deshpande P, Raghavan S (2015) Indexing and matching trajectories under inconsistent sampling rates. In: ICDE 2015, pp 999–1010
Ta N, Li G, Xie Y, Li C, Hao S, Feng J (2017) Signature-based similarity trajectory join. IEEE Trans Knowl Data Eng 29(4):870–883
Yi B-K, Jagadish HV, Faloutsos C (1998) Efficient retrieval of similar time sequences under time warping. In: ICDE 1998, pp 201–208
Chang J-W, Bista R, Kim Y-C, Kim Y-K (2007) Spatio-temporal similarity measure algorithm for moving objects on spatial networks. In: ICCSA 2007, pp 1165–1178
Shang S, Chen L, Wei Z, Jensen CS, Zheng K, Kalnis P (2017) Trajectory similarity join in spatial networks. PVLDB 10(11):1178–1189
Shang S, Chen L, Wei Z, Jensen CS, Zheng K, Kalnis P (2018) Parallel trajectory similarity joins in spatial networks. VLDB J, 27(3):395–420
Shang S, Ding R, Zheng K, Jensen CS, Kalnis P, Zhou X (2014) Personalized trajectory matching in spatial networks. VLDB J 23(3):449–468
Ding H, Trajcevski G, Scheuermann P (2008) Efficient similarity join of large sets of moving object trajectories. In: TIME 2008, pp 79–87
Vlachos M, Gunopulos D, Kollios G (2002) Discovering similar multidimensional trajectories. In: ICDE 2002, pp 673–684
Chen Z, Shen HT, Zhou X, Yu Z, Xie X (2010) Searching trajectories by locations: an efficiency study. In: SIGMOD 2010, pp 255–266
Ding X, Yuan Y, Su L, Wang W, Ai Z, Liu A (2018) Modeling and optimization of image mapper for snapshot image mapping spectrometer. IEEE Access 6:29344–29352
Qi S, Bouros P, Sacharidis D, Mamoulis N (2015) Efficient point-based trajectory search. In: ISSTD, 2015. Springer, pp 179–196
Shang S, Ding R, Bo Y, Xie K, Zheng K, Kalnis P (2012) User oriented trajectory search for trip recommendation. In: EDBT 12, pp 156–167
Xie D, Li F, Phillips JM (2017) Distributed trajectory similarity search. PVLDB 10(11):1478–1489
Zhao P, Zhao Q, Zhang C, Su G, Qi Z, Rao W (2019) CLEAN: frequent pattern-based trajectory spatial-temporal compression on road networks. In: 20th IEEE international conference on mobile data management, MDM 2019, Hong Kong, SAR, China, June 10-13, 2019, pp 605–610
Zhao P, Zhao Q, Zhang C, Su G, Qi Z, Rao Wg (2020) CLEAN: frequent pattern-based trajectory compression and computation on road networks. China Communications
Yuan P, Zhao Q, Rao W, Yuan M, Zeng J (2017) Searching k-nearest neighbor trajectories on road networks. In: ADC 2017, pp 85–97
Newson P, Krumm J (2009) Hidden Markov map matching through noise and sparseness. In: ACM-GIS 2009, pp 336–343
Zheng K, Shang S, Yuan NJ, Yi Y (2013) Towards efficient search for activity trajectories. In: ICDE 2013, pp 230–241
Isaacson E (1988) Numerical recipes: the art of scientific computing (william h. press, brian p. flannery, saul a. teukolsky, and william t. vetterling). SIAM Rev 30 (2):331–332
Hjaltason GR, Samet H (1999) Distance browsing in spatial databases. ACM Transon Datab Syst (TODS) 24(2):265–318
Sadri A, Salim FD, Ren Y (2017) Full trajectory prediction: what will you do the rest of the day?. In: UbiComp 17. ACM, pp 189–192
Vreeken J, van Leeuwen M, Siebes A (2011) Krimp: mining itemsets that compress. Data Min Knowl Discov 23(1):169–214
Visvalingam M, Whyatt JD (1990) The douglas-peucker algorithm for line simplification: re-evaluation through visualization. Comput Graph Forum 9(3):213–225
Acknowledgements
This work is partially supported by National Natural Science Foundation of China (Grant No. 61772371, No. 61972286).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhao, P., Rao, W., Zhang, C. et al. SST: Synchronized Spatial-Temporal Trajectory Similarity Search. Geoinformatica 24, 777–800 (2020). https://doi.org/10.1007/s10707-020-00405-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10707-020-00405-y