Constant-time Connectivity Querying in Dynamic Graphs
Authors: 
Lantian Xu, Dong Wen, Lu Qin, Ronghua Li, Ying Zhang, Xuemin LinAuthors Info & Claims
Lantian Xu, Dong Wen, Lu Qin, Ronghua Li, Ying Zhang, Xuemin LinAuthors Info & ClaimsArticle No.: 230, Pages 1 - 23
Abstract
Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connected via a path. Given frequent edge updates in real graph applications, in this paper, we study connectivity query processing in fully dynamic graphs, where edges are frequently inserted or deleted. A recent solution, called D-tree, maintains a spanning tree for each connected component and applies several heuristics to reduce the depth of the tree. To improve the efficiency, we propose a new spanning-tree-based solution by maintaining a disjoint-set tree simultaneously. By combining the advantages of two trees, we achieve the constant query time complexity and also significantly improve the theoretical running time in both edge insertion and edge deletion. Our performance studies on real large datasets show considerable improvement of our algorithms.
References
[1]
Rakesh Agrawal, Alexander Borgida, and Hosagrahar Visvesvaraya Jagadish. 1989. Efficient management of transitive relationships in large data and knowledge bases. ACM SIGMOD Record, Vol. 18, 2 (1989), 253--262.
[2]
Ramadhana Bramandia, Byron Choi, and Wee Keong Ng. 2009. Incremental maintenance of 2-hop labeling of large graphs. IEEE Transactions on Knowledge and Data Engineering, Vol. 22, 5 (2009), 682--698.
[3]
Qing Chen, Oded Lachish, Sven Helmer, and Michael H. Böhlen. 2022. Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs. Proc. VLDB Endow., Vol. 15, 11 (2022), 3263--3276.
[4]
James Cheng, Silu Huang, Huanhuan Wu, and Ada Wai-Chee Fu. 2013. Tf-label: a topological-folding labeling scheme for reachability querying in a large graph. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. 193--204.
[5]
Cynthia Baby Daniel, S Saravanan, and Samson Mathew. 2020. Gis based road connectivity evaluation using graph theory. In Transportation Research: Proceedings of CTRG 2017. Springer, 213--226.
[6]
Monika Rauch Henzinger and Valerie King. 1995. Randomized dynamic graph algorithms with polylogarithmic time per operation. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. 519--527.
[7]
Monika R Henzinger and Valerie King. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM (JACM), Vol. 46, 4 (1999), 502--516.
[8]
Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. 1998. Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23--26, 1998, Jeffrey Scott Vitter (Ed.). ACM, 79--89. https://doi.org/10.1145/276698.276715
[9]
Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. 2001. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM, Vol. 48, 4 (2001), 723--760. https://doi.org/10.1145/502090.502095
[10]
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup. 2023. Fully Dynamic Connectivity in O(łog n (łoglog n)^2) Amortized Expected Time. TheoretiCS, Vol. 2 (2023).
[11]
Raj Iyer, David Karger, Hariharan Rahul, and Mikkel Thorup. 2001. An experimental study of polylogarithmic, fully dynamic, connectivity algorithms. Journal of Experimental Algorithmics (JEA), Vol. 6 (2001), 4--es.
[12]
Ruoming Jin, Yang Xiang, Ning Ruan, and David Fuhry. 2009. 3-hop: a high-compression indexing scheme for reachability query. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. 813--826.
[13]
Qiuyi Lyu, Yuchen Li, Bingsheng He, and Bin Gong. 2021. DBL: Efficient Reachability Queries on Dynamic Graphs. In Database Systems for Advanced Applications: 26th International Conference, DASFAA 2021, Taipei, Taiwan, April 11--14, 2021, Proceedings, Part II 26. Springer, 761--777.
[14]
Damiano Di Francesco Maesa, Andrea Marino, and Laura Ricci. 2016. Uncovering the bitcoin blockchain: an analysis of the full users graph. In 2016 IEEE international conference on data science and advanced analytics (DSAA). IEEE, 537--546.
[15]
Zijun Mao, Hong Yao, Qi Zou, Weiting Zhang, Ying Dong, et al. 2021. Digital contact tracing based on a graph database algorithm for emergency management during the COVID-19 epidemic: Case study. JMIR mHealth and uHealth, Vol. 9, 1 (2021), e26836.
[16]
Batul J Mirza, Benjamin J Keller, and Naren Ramakrishnan. 2003. Studying recommendation algorithms by graph analysis. Journal of intelligent information systems, Vol. 20 (2003), 131--160.
[17]
Georgios A. Pavlopoulos, Maria Secrier, Charalampos N. Moschopoulos, Theodoros G. Soldatos, Sophia Kossida, Jan Aerts, Reinhard Schneider, and Pantelis G. Bagos. 2011. Using graph theory to analyze biological networks. BioData Min., Vol. 4 (2011), 10.
[18]
You Peng, Ying Zhang, Xuemin Lin, Lu Qin, and Wenjie Zhang. 2020. Answering billion-scale label-constrained reachability queries within microsecond. Proceedings of the VLDB Endowment, Vol. 13, 6 (2020), 812--825.
[19]
Miao Qiao, Hong Cheng, Lu Qin, Jeffrey Xu Yu, Philip S Yu, and Lijun Chang. 2013. Computing weight constraint reachability in large networks. The VLDB journal, Vol. 22, 3 (2013), 275--294.
[20]
Ralf Schenkel, Anja Theobald, and Gerhard Weikum. 2004. HOPI: An efficient connection index for complex XML document collections. In Advances in Database Technology-EDBT 2004: 9th International Conference on Extending Database Technology, Heraklion, Crete, Greece, March 14--18, 2004 9. Springer, 237--255.
[21]
Ralf Schenkel, Anja Theobald, and Gerhard Weikum. 2005. Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In 21st International Conference on Data Engineering (ICDE'05). IEEE, 360--371.
[22]
Yossi Shiloach and Shimon Even. 1981. An on-line edge-deletion problem. Journal of the ACM (JACM), Vol. 28, 1 (1981), 1--4.
[23]
Jingyi Song, Dong Wen, Lantian Xu, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2024. On Querying Historical Connectivity in Temporal Graphs. Proc. ACM Manag. Data, Vol. 2, 3 (2024), 157.
[24]
Robert Endre Tarjan. 1975. Efficiency of a good but not linear set union algorithm. Journal of the ACM (JACM), Vol. 22, 2 (1975), 215--225.
[25]
Robert Endre Tarjan and Jan van Leeuwen. 1984. Worst-case Analysis of Set Union Algorithms. J. ACM, Vol. 31, 2 (1984), 245--281.
[26]
Robert Endre Tarjan and Uzi Vishkin. 1984. Finding biconnected componemts and computing tree functions in logarithmic parallel time. In 25th Annual Symposium onFoundations of Computer Science, 1984. IEEE, 12--20.
[27]
Mikkel Thorup. 2000. Near-optimal fully-dynamic graph connectivity. In Proceedings of the thirty-second annual ACM symposium on Theory of computing. 343--350.
[28]
Hao Wei, Jeffrey Xu Yu, Can Lu, and Ruoming Jin. 2014. Reachability querying: An independent permutation labeling approach. Proceedings of the VLDB Endowment, Vol. 7, 12 (2014), 1191--1202.
[29]
Dong Wen, Yilun Huang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2020. Efficiently answering span-reachability queries in large temporal graphs. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 1153--1164.
[30]
Dong Wen, Bohua Yang, Ying Zhang, Lu Qin, Dawei Cheng, and Wenjie Zhang. 2022. Span-reachability querying in large temporal graphs. VLDB J., Vol. 31, 4 (2022), 629--647.
[31]
Yuanyuan Zeng, Wangdong Yang, Xu Zhou, Guoqing Xiao, Yunjun Gao, and Kenli Li. 2022. Distributed Set Label-Constrained Reachability Queries over Billion-Scale Graphs. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1969--1981.
[32]
Junhua Zhang, Wentao Li, Lu Qin, Ying Zhang, Dong Wen, Lizhen Cui, and Xuemin Lin. 2022. Reachability Labeling for Distributed Graphs. In 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9--12, 2022. IEEE, 686--698.
[33]
Andy Diwen Zhu, Wenqing Lin, Sibo Wang, and Xiaokui Xiao. 2014. Reachability queries on large dynamic graphs: a total order approach. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 1323--1334.
Index Terms
- Constant-time Connectivity Querying in Dynamic Graphs
Recommendations
On Querying Historical Connectivity in Temporal Graphs
SIGMODWe study the historical connectivity query in temporal graphs where edges continuously arrive. Given an arbitrary time window, and two query vertices, the problem aims to identify if two vertices are connected by a path in the snapshot of the window. The ...
On the connectivity of p-diamond-free graphs
For a vertex v of a graph G, we denote by d(v) the degree of v. The local connectivity@k(u,v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as @k(G)=min{@k(u,v)|u,v@...
On the connectivity of p-diamond-free vertex transitive graphs
Let G be a graph of order n(G), minimum degree @d(G) and connectivity @k(G). We call the graph Gmaximally connected when @k(G)=@d(G). The graph G is said to be superconnected if every minimum vertex cut isolates a vertex. For an integer p>=1, we define ...
Comments
Information & Contributors
Information
Published In
December 2024
792 pages
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 December 2024
Published in PACMMOD Volume 2, Issue 6
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 82Total Downloads
- Downloads (Last 12 months)82
- Downloads (Last 6 weeks)82
Reflects downloads up to 27 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in