Skip to main content

A Multi-Constrained Temporal Path Query System

  • Conference paper
  • First Online:

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

Abstract

The temporal path problem is significant and challenging, where the connections between the vertices are temporal and there can be many attributes on the vertices and edges, such as vehicle speed and the price of a flight. Then in path finding, in addition to the single requirement of the length, or the arrival time, people would like to specify multiple constraints on the attributes to illustrate their requirements in real applications, such as the total cost, the total travel time and the stopover interval of a flight between two cities. In this paper, we devise a system called MCTP to answer the new popular Multi-Constrained Path Queries (MCPQs) in attributed temporal graphs. To the best of our knowledge, this is the first system that supports MCPQs.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://112.74.36.170:8080/MCTP.

References

  1. Shah, N., Koutra, D., Zou, T., Gallagher, B., Faloutsos, C.: Timecrunch: interpretable dynamic graph summarization. In: KDD, pp. 1055–1064 (2015)

    Google Scholar 

  2. Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, 31 May–4 June 2015, pp. 967–982. ACM (2015)

    Google Scholar 

  3. Wu, H., Cheng, J., Huang, S., Ke, Y., Lu, Y., Xu, Y.: Path problems in temporal graphs. VLDB 7(9), 721–732 (2014)

    Google Scholar 

  4. Zhang, B., Hao, J., Mouftah, H.T.: Bidirectional multi-constrained routing algorithms. IEEE Trans. Comput. 63, 2174–2186 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guanfeng Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shi, J., Liu, G., Zhao, A., Liu, A., Li, Z., Zheng, K. (2018). A Multi-Constrained Temporal Path Query System. In: Woo, C., Lu, J., Li, Z., Ling, T., Li, G., Lee, M. (eds) Advances in Conceptual Modeling. ER 2018. Lecture Notes in Computer Science(), vol 11158. Springer, Cham. https://doi.org/10.1007/978-3-030-01391-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01391-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01390-5

  • Online ISBN: 978-3-030-01391-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics