Abstract
Recently, with the proliferation of path query-based applications, extensive research has concentrated on the path query problem. Existing works either focus on the path query over temporal graphs or skyline path query over static graphs, ignoring the temporal information. Meanwhile, edge-labeled temporal graphs are widespread in our daily life, such as traffic networks labeled with “expressway” or “provincial road”. In this paper, we define a novel skyline path query over temporal graphs with labels. To handle this problem, we first devise an index named MP-index, divided into two phrases of MP nodes search and Mout set construction. Based on this index, we propose an efficient TMP algorithm to provide the skyline path query over temporal graphs with labels. Finally, extensive experiments show the effectiveness and efficiency of our proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cai, T., et al.: Incremental graph computation: anchored vertex tracking in dynamic social networks. In: TKDE, pp. 1–14 (2022). https://doi.org/10.1109/TKDE.2022.3199494
Chen, X., Wang, K., Lin, X., Zhang, W., Qin, L., Zhang, Y.: Efficiently answering reachability and path queries on temporal bipartite graphs. In: PVLDB (2021)
Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: Efficient processing of k-hop reachability queries. VLDB J. 23(2), 227–252 (2014)
Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)
Gong, Q., Cao, H.: Backbone index to support skyline path queries over multi-cost road networks. In: EDBT, pp. 2–325 (2022)
Hassan, M.S., Aref, W.G., Aly, A.M.: Graph indexing for shortest-path finding over dynamic sub-graphs. In: SIGMOD, pp. 1183–1197 (2016)
Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: ICDE, pp. 261–272 (2010)
Li, M., Xin, J., Wang, Z., Liu, H.: Accelerating minimum temporal paths query based on dynamic programming. In: ADMA, pp. 48–62 (2019)
Nicosia, V., Tang, J., Musolesi, M., Russo, G., Mascolo, C., Latora, V.: Components in time-varying graphs. Chaos Interdiscip. J. Nonlinear Sci. 22(2), 023101 (2012)
Noto, M., Sato, H.: A method for the shortest path search by extended Dijkstra algorithm. In: SMC, vol. 3, pp. 2316–2320 (2000)
Rice, M., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. In: PVLDB, vol. 4, pp. 69–80 (2010)
Shekelyan, M., Jossé, G., Schubert, M.: Linear path skylines in multicriteria networks. In: ICDE, pp. 459–470 (2015)
Song, X., Li, J., Cai, T., Yang, S., Yang, T., Liu, C.: A survey on deep learning based knowledge tracing. Knowl.-Based Syst. 258, 110036 (2022)
Tian, Y., Lee, K.C., Lee, W.C.: Finding skyline paths in road networks. In: SIGSPATIAL, pp. 444–447 (2009)
Valstar, L.D., Fletcher, G.H., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: SIGMOD, pp. 345–358 (2017)
Wang, Y., Li, G., Tang, N.: Querying shortest paths on time dependent road networks. In: PVLDB, vol. 12, pp. 1249–1261 (2019)
Wu, H., Cheng, J., Ke, Y., Huang, S., Huang, Y., Wu, H.: Efficient algorithms for temporal path computation. TKDE 28(11), 2927–2942 (2016)
Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Multi-cost optimal route planning under time-varying uncertainty. In: ICDE (2014)
Yang, S., et al.: Robust cross-network node classification via constrained graph mutual information. Knowl.-Based Syst. 257, 109852 (2022)
Yang, Y., Gao, H., Yu, J.X., Li, J.: Finding the cost-optimal path with time constraint over time-dependent graphs. In: PVLDB, vol. 7, pp. 673–684 (2014)
Yuan, Y., Lian, X., Wang, G., Ma, Y., Wang, Y.: Constrained shortest path query in a large time-dependent graph. In: PVLDB, vol. 12, pp. 1058–1070 (2019)
Acknowledgements
This study was funded by the National Natural Science Foundation of China (Nos.62072220, 61502215); National Key Research and Development Program of China (No.2022YFC3004603); Natural Science Foundation of Liaoning Province (Nos.2022-KF-13-06, 2022-BS-111, LJKFZ20220174); Central Government Guides Local Science and Technology Development Foundation Project of Liaoning Province (No.2022JH6/100100032).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ding, L., Zhang, G., Ma, J., Li, M. (2023). An Efficient Index-Based Method for Skyline Path Query over Temporal Graphs with Labels. In: Wang, X., et al. Database Systems for Advanced Applications. DASFAA 2023. Lecture Notes in Computer Science, vol 13945. Springer, Cham. https://doi.org/10.1007/978-3-031-30675-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-30675-4_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30674-7
Online ISBN: 978-3-031-30675-4
eBook Packages: Computer ScienceComputer Science (R0)