Abstract
Trajectory similarity search has been an attractive and challenging topic which spawns various applications. In this work, we study the problem that finds trajectories close to some query locations with timestamps designated by a user. We firstly define the similarity between the query locations and trajectory on road networks. Then, we propose a method to retrieve similar trajectories based on Network Voronoi Diagram. By taking advantage of Network Voronoi Diagram, the proposed method can accelerate the query processing through some pre-computation. Finally, we verify the efficiency of the proposed method by extensive experiments.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Yi, B.-K., Jagadish, H., Faloutsos, C.: Efficient Retrieval of Similar Time Sequences under Time Warping. In: 14th IEEE International Conference on Data Engineering, pp. 23–27. IEEE Press, Orlando (1998)
Vlachos, M., Kollios, G., Gunopulos, D.: Discovering Similar Multidimensional Trajectories. In: 18th IEEE International Conference on Data Engineering, pp. 673–684. IEEE Press, San Jose (2002)
Chen, L., Ng, R.: On the Marriage of Lp-norms and Edit Distance. In: 30th International Conference on Very Large Data Bases, pp. 792–803. Morgan Kaufmann, Toronto (2004)
Chen, L., Özsu, M.T., Oria, V.: Robust and Fast Similarity Search for Moving Object Trajectories. In: ACM SIGMOD International Conference on Management of Data, pp. 491–502. ACM, Baltimore (2005)
Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations, Concepts and Applications of Voronoi Diagrams. John Wiley and Sons Ltd, New York (2000)
Lin, B., Su, J.W.: Shapes Based Trajectory Queries for Moving Objects. In: 13th Annual ACM International Workshop on Geographic Information Systems, pp. 21–30. ACM, New York (2005)
Yanagisawa, Y., Akahani, J.-i., Satoh, T.: Shape-Based Similarity Query for Trajectory of Mobile Objects. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 63–77. Springer, Heidelberg (2003)
Hwang, J.-R., Kang, H.-Y., Li, K.-J.: Searching for Similar Trajectories on Road Networks Using Spatio-temporal Similarity. In: Manolopoulos, Y., Pokorný, J., Sellis, T.K. (eds.) ADBIS 2006. LNCS, vol. 4152, pp. 282–295. Springer, Heidelberg (2006)
Tiakas, E., Papadopoulos, A.N., Nanopoulos, A., Manolopoulos, Y., Stojanovic, D., Djordjevic-Kajan, S.: Searching for Similar Trajectories in Spatial Networks. Journal of Systems and Software 82, 772–788 (2009)
Chen, Z., Shen, H., Zhou, X., Zheng, Y., Xie, X.: Searching Trajectories by Locations: An Efficiency Study. In: ACM SIGMOD International Conference on Management of Data, pp. 255–266. ACM, Indianapolis (2010)
Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: 30th International Conference on Very Large Data Bases, pp. 840–851. Morgan Kaufmann, Toronto (2004)
Road Network Datasets, http://www.cs.utah.edu/lifeifei/SpatialDataset.htm
Brinkhoff, T.: Generating Network-Based Moving Objects. In: 12th International Conference on Scientific and Statistical Database Management, pp. 253–255. IEEE Press, Berlin (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sha, W., Xiao, Y., Wang, H., Li, Y., Wang, X. (2015). Searching for Spatio-temporal Similar Trajectories on Road Networks Using Network Voronoi Diagram. In: Bian, F., Xie, Y. (eds) Geo-Informatics in Resource Management and Sustainable Ecosystem. GRMSE 2014. Communications in Computer and Information Science, vol 482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45737-5_37
Download citation
DOI: https://doi.org/10.1007/978-3-662-45737-5_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45736-8
Online ISBN: 978-3-662-45737-5
eBook Packages: Computer ScienceComputer Science (R0)