A Multi-Constrained Temporal Path Query System
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.
KeywordsPath finding Temporal graph Multiple constraints
- 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