Abstract
Many real-world graphs contain edge labels for representing different types of relations between nodes, such as social networks, biological networks and knowledge graphs. As a fundamental task, the label-constrained reachability (LCR) query asks whether a given vertex s can reach another vertex t, only using a restricted set of given edge labels. However, existing works build a heavy index while taking too much time for answering queries online, exhibiting a poor performance on large graphs. To further reduce the index size and accelerate both index construction and query processing, we introduce two novel pruning techniques including degree-one reduction and unreachable query filter. Extensive experiments demonstrate that our proposed techniques significantly boost state-of-the-art methods.
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
Similar content being viewed by others
References
Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD 2013, pp. 349–360 (2013)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)
Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: SIGMOD 2010, pp. 123–134 (2010)
Kunegis, J.: KONECT: the Koblenz network collection. In: WWW 2013, pp. 1343–1350 (2013)
Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection (2014)
Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling distance labeling on small-world networks. In: SIGMOD 2019, pp. 1060–1077 (2019)
Pastor-Satorras, R., Rubí, M., Diaz-Guilera, A.: Statistical Mechanics of Complex Networks. Lecture Notes in Physics (2003)
Peng, Y., Lin, X., Zhang, Y., Zhang, W., Qin, L.: Answering reachability and k-reach queries on large graphs with label constraints. VLDB J. (2021)
Peng, Y., Zhang, Y., Lin, X., Qin, L., Zhang, W.: Answering billion-scale label-constrained reachability queries within microsecond. VLDB 13(6), 812–825 (2020)
Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI 2015, pp. 4292–4293 (2015)
Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? TKDE 29(3), 683–697 (2017)
Tang, X., Chen, Z., Zhang, H., Liu, X., Shi, Y., Shahzadi, A.: An optimized labeling scheme for reachability queries. Comput. Mater. Continua 55, 267–283 (2018)
Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD 2007, pp. 845–856 (2007)
Valstar, L.D., Fletcher, G.H., Yoshida, Y.: Landmark indexing for evaluation of label-constrained reachability queries. In: SIGMOD 2017, pp. 345–358 (2017)
Veloso, R.R., Cerf, L., Meira Jr, W., Zaki, M.J.: Reachability queries in very large graphs: a fast refined online search approach. In: EDBT, pp. 511–522 (2014)
Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: a labelling approach. In: SIGMOD 2015, pp. 967–982 (2015)
Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. VLDB 10(2), 61–72 (2016)
Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. VLDB J. 27(1), 1–26 (2018)
Yano, Y., Akiba, T., Iwata, Y., Yoshida, Y.: Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. In: CIKM 2013, pp. 1601–1606 (2013)
Yildirim, H., Chaoji, V., Zaki, M.J.: GRAIL: a scalable index for reachability queries in very large graphs. VLDB J. 21(4), 509–534 (2012)
Zafarani, R., Liu, H.: Social computing data repository at ASU (2009)
Zhou, J., Yu, J.X., Li, N., Wei, H., Chen, Z., Tang, X.: Accelerating reachability query processing based on DAG reduction. VLDB J. 27(2), 271–296 (2018)
Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: SIGMOD 2014, pp. 1323–1334 (2014)
Zou, L., Xu, K., Yu, J.X., Chen, L., Xiao, Y., Zhao, D.: Efficient processing of label-constraint reachability queries in large graphs. Inf. Syst. 40, 47–66 (2014)
Acknowledgement
This work was supported by National Natural Science Foundation of China (Grant No. 61902074).
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
Cai, Y., Zheng, W. (2023). Answering Label-Constrained Reachability Queries via Reduction Techniques. In: Wang, X., et al. Database Systems for Advanced Applications. DASFAA 2023. Lecture Notes in Computer Science, vol 13943. Springer, Cham. https://doi.org/10.1007/978-3-031-30637-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-30637-2_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-30636-5
Online ISBN: 978-3-031-30637-2
eBook Packages: Computer ScienceComputer Science (R0)