An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs

Qing Chen; Michael H. Böhlen; Sven Helmer

doi:10.1145/3709660

journal article Feb 10, 2025

An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs

Qing Chen

Michael H. Böhlen

Sven Helmer

Proceedings of the ACM on Management of Data Vol. 3 No. 1 pp. 1-26 · Association for Computing Machinery (ACM)

View at Publisher Save 10.1145/3709660

Abstract

During the past decades significant efforts have been made to propose data structures for answering connectivity queries on fully dynamic graphs, i.e., graphs with frequent insertions and deletions of edges. However, a comprehensive understanding of how these data structures perform in practice is missing, since not all of them have been implemented, let alone evaluated experimentally. We provide reference implementations for the proposed data structures and experimentally evaluate them on a wide range of graphs. Our findings show that the current solutions are not ready to be deployed in systems as is, as every data structure has critical weaknesses when used in practice. Key limitations that must be overcome are the space and time overhead incurred by balanced data structures, the degeneration of the runtime of space-efficient data structures in worst case scenarios, and the maintenance costs for balanced data structures. We detail our findings in the experimental evaluation and provide recommendations for implementing robust solutions for answering connectivity queries on dynamic graphs.

Topics

No keywords indexed for this article. Browse by subject →

References

52

[1]

2024. Network Diameter. Retrieved May 24, 2024 from http://konect.cc/statistics/diam/

[2]

2024. NetworkX. Retrieved March 24 2024 from https://networkx.org/

[3]

2024. NetworkX: complete graph. Retrieved January 9, 2024 from https://networkx.org/documentation/stable/reference/generated/networkx.generators.classic.complete_graph.html

[4]

2024. NetworkX: gnm random graph. Retrieved January 9, 2024 from https://networkx.org/documentation/stable/reference/generated/networkx.generators.random_graphs.gnm_random_graph.html

[5]

2024. NetworkX: path graph. Retrieved January 9, 2024 from https://networkx.org/documentation/stable/reference/generated/networkx.generators.classic.path_graph.html

[6]

2024. NetworkX: power law graph. Retrieved January 9, 2024 from https://networkx.org/documentation/stable/reference/generated/networkx.generators.random_graphs.powerlaw_cluster_graph.html

[7]

2024. NetworkX: star graph. Retrieved January 9, 2024 from https://networkx.org/documentation/stable/reference/generated/networkx.generators.classic.star_graph.html

[8]

2024. Road networks for full USA. Retrieved January 22, 2024 from http://konect.cc/networks/dimacs9-USA/

[9]

2024. SNAP: Stack Overflow temporal network. Retrieved January 22, 2024 from http://snap.stanford.edu/data/sxstackoverflow.html

[10]

David Alberts. 1995. Implementation of the dynamic connectivity algorithm by Monika Rauch Henzinger and Valerie King. http://dx.doi.org/10.17169/refubium-21860. 10.17169/refubium-21860

[11]

10.1145/264216.264223

[12]

Waleed Ammar, Dirk Groeneveld, Chandra Bhagavatula, Iz Beltagy, Miles Crawford, Doug Downey, Jason Dunkelberger, Ahmed Elgohary, Sergey Feldman, Vu Ha, Rodney Kinney, Sebastian Kohlmeier, Kyle Lo, Tyler Murray, Hsu-Han Ooi, Matthew Peters, Joanna Power, Sam Skjonsberg, Lucy Lu Wang, Chris Wilhelm, Zheng Yuan, Madeleine van Zuylen, and Oren Etzioni. 2018. Construction of the Literature Graph in Semantic Scholar. In NAACL. https://www.semanticscholar.org/paper/09e3cf5704bcb16e6657f6ceed70e93373a54618

[13]

10.1109/icde.2010.5447905

[14]

10.1007/978-3-031-01864-0

[15]

Qing Chen Michael H. Böhlen and Sven Helmer. 2025. An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs (Extended Version). arXiv:2501.02278 https://arxiv.org/abs/ 2501.02278

[16]

10.14778/3551793.3551868

[17]

10.1145/3448016.3457270

[18]

10.1109/sfcs.1992.267818

[19]

10.1145/167088.167159

[20]

Incremental Graph Computations: Doable and Undoable

Wenfei Fan, Chao Tian

ACM Transactions on Database Systems 10.1145/3500930

[21]

Xiyang Feng Guodong Jin Ziyi Chen Chang Liu and Semih Saliholu. 2023. Kùzu Graph Database Management System. In CIDR.

[22]

10.14778/3514061.3514065

[23]

Alan Gibbons. 1985. Algorithmic graph theory. Cambridge university press.

[24]

10.1109/tpas.1980.319631

[25]

10.1145/3555806

[26]

10.1007/pl00009228

[27]

10.1145/225058.225269

[28]

10.1145/320211.320215

[29]

10.5555/280032.280036

[30]

10.1145/502090.502095

[31]

10.1145/3294052.3319698

[32]

10.1137/1.9781611974782.32

[33]

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup. 2023. Fully Dynamic Connectivity in (log(log log)2 ) Amortized Expected Time. TheoretiCS 2 (2023).

[34]

10.1145/945394.945398

[35]

10.1145/1081870.1081893

[36]

Graph evolution

Jure Leskovec, Jon Kleinberg, Christos Faloutsos

ACM Transactions on Knowledge Discovery from Data 10.1145/1217299.1217301

[37]

10.1109/drpt.2008.4523877

[38]

Alan Mislove. 2009. Online Social Networks: Measurement Analysis and Applications to Distributed Information Systems. Ph.D. Dissertation. Rice University Department of Computer Science.

[39]

10.1109/focs.2007.59

[40]

10.1145/1007352

[41]

10.1145/3232535

[42]

10.1007/bf01940876

[43]

10.1145/800076.802464

[44]

10.1145/3828.3835

[45]

10.1145/3654960

[46]

10.1109/tkde.2016.2631160

[47]

10.1137/0606031

[48]

An Efficient Parallel Biconnectivity Algorithm

Robert E. Tarjan, Uzi Vishkin

SIAM Journal on Computing 10.1137/0214061

[49]

10.1145/335305.335345

[50]

Douglas Brent West et al. 2001. Introduction to graph theory. Vol. 2. Prentice hall Upper Saddle River.

Showing 50 of 52 references

Metrics

1

Citations

52

References

Details

Published: Feb 10, 2025
Vol/Issue: 3(1)
Pages: 1-26
License: View

Authors

Q

Qing Chen

University of Zurich, Zurich, Switzerland

M

Michael H. Böhlen

University of Zurich, Zurich, Switzerland

S

Sven Helmer

University of Zurich, Zurich, Switzerland

Funding

University of Zurich, CanDoc Grant Award: FK-23-021

Cite This Article

Qing Chen, Michael H. Böhlen, Sven Helmer (2025). An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs. Proceedings of the ACM on Management of Data, 3(1), 1-26. https://doi.org/10.1145/3709660

An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs

You May Also Like