Skip to main content
Springer Nature Link
Log in

Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks

  • Conference paper
  • First Online:
Databases Theory and Applications (ADC 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12008))

Included in the following conference series:

Abstract

Finding the shortest paths in road network is an important query in our life nowadays, and various index structures are constructed to speed up the query answering. However, these indexes can hardly work in real-life scenario because the traffic condition changes dynamically, which makes the pathfinding slower than in the static environment. In order to speed up path query answering in the dynamic road network, we propose a framework to support these indexes. Firstly, we view the dynamic graph as a series of static snapshots. After that, we propose two kinds of methods to select the typical snapshots. The first kind is time-based and it only considers the temporal information. The second category is the graph representation-based, which considers more insights: edge-based that captures the road continuity, and vertex-based that reflects the region traffic fluctuation. Finally, we propose the snapshot matching to find the most similar typical snapshot for the current traffic condition and use its index to answer the query directly. Extensive experiments on real-life road network and traffic conditions validate the effectiveness of our approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Zhang, M., Li, L., Hua, W., Zhou, X.: Batch processing of shortest path queries in road networks. In: Chang, L., Gan, J., Cao, X. (eds.) ADC 2019. LNCS, vol. 11393, pp. 3–16. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-12079-5_1

    Chapter  Google Scholar 

  2. Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient batch processing of shortest path queries in road networks. In: 2019 20th IEEE International Conference on Mobile Data Management (MDM), pp. 100–105. IEEE (2019)

    Google Scholar 

  3. Thomsen, J.R., Yiu, M.L., Jensen, C.S.: Effective caching of shortest paths for location-based services. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 313–324. ACM (2012)

    Google Scholar 

  4. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68552-4_24

    Chapter  Google Scholar 

  5. Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-Hop-labeling: efficient shortest distance queries on road networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 709–724. ACM (2018)

    Google Scholar 

  6. Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 43–54. ACM (2008)

    Google Scholar 

  7. Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. Proc. VLDB Endow. 10(2), 61–72 (2016)

    Article  Google Scholar 

  8. Li, L., Hua, W., Du, X., Zhou, X.: Minimal on-road time route scheduling on time-dependent graphs. Proc. VLDB Endow. 10(11), 1274–1285 (2017)

    Article  Google Scholar 

  9. Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments. Society for Industrial and Applied Mathematics, pp. 97–105 (2009)

    Google Scholar 

  10. Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 902–913, April 2019

    Google Scholar 

  11. Zhao, X., Xiao, C., Lin, X., Wang, W.: Efficient graph similarity joins with edit distance constraints. In: 2012 IEEE 28th International Conference on Data Engineering, pp. 834–845. IEEE (2012)

    Google Scholar 

  12. Gouda, K., Hassaan, M.: CSI_GED: an efficient approach for graph edit similarity computation. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 265–276. IEEE (2016)

    Google Scholar 

  13. Li, Z., Jian, X., Lian, X., Chen, L.: An efficient probabilistic approach for graph similarity search. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 533–544. IEEE (2018)

    Google Scholar 

  14. Chen, L., Gao, Y., Zhang, Y., Jensen, C.S., Zheng, B.: Efficient and incremental clustering algorithms on star-schema heterogeneous graphs. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 256–267. IEEE (2019)

    Google Scholar 

  15. Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J.- Int. J. Very Large Data Bases 27(3), 321–345 (2018)

    Article  Google Scholar 

  16. Li, L., Kim, J., Xu, J., Zhou, X.: Time-dependent route scheduling on road networks. SIGSPATIAL Spec. 10(1), 10–14 (2018)

    Article  Google Scholar 

  17. Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-dependent contraction hierarchies and approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 166–177. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13193-6_15

    Chapter  Google Scholar 

  18. Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE)

    Google Scholar 

  19. Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. ACM, pp. 766–777 (2005)

    Google Scholar 

  20. Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. Proc. VLDB Endow. 2(1), 718–729 (2009)

    Article  Google Scholar 

  21. Wang, G., Wang, B., Yang, X., Yu, G.: Efficiently indexing large sparse graphs for similarity search. IEEE Trans. Knowl. Data Eng. 24(3), 440–451 (2010)

    Article  Google Scholar 

  22. Ester, M., Kriegel, H.-P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96(34), 226–231 (1996)

    Google Scholar 

  23. Gan, J., Tao, Y.: DBSCAN revisited: mis-claim, un-fixability, and approximation. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 519–530. ACM (2015)

    Google Scholar 

  24. Defays, D.: An efficient algorithm for a complete link method. Comput. J. 20(4), 364–366 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia

    Mengxuan Zhang, Lei Li, Wen Hua & Xiaofang Zhou

Authors
  1. Mengxuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wen Hua
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaofang Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mengxuan Zhang .

Editor information

Editors and Affiliations

  1. University of Melbourne, Parkville, Australia

    Renata Borovica-Gajic

  2. School of Computing and Information Systems, University of Melbourne, Parkville, VIC, Australia

    Jianzhong Qi

  3. Monash University, Clayton, Australia

    Weiqing Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, M., Li, L., Hua, W., Zhou, X. (2020). Typical Snapshots Selection for Shortest Path Query in Dynamic Road Networks. In: Borovica-Gajic, R., Qi, J., Wang, W. (eds) Databases Theory and Applications. ADC 2020. Lecture Notes in Computer Science(), vol 12008. Springer, Cham. https://doi.org/10.1007/978-3-030-39469-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-39469-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-39468-4

  • Online ISBN: 978-3-030-39469-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics