On Querying Historical Connectivity in Temporal Graphs
Article No.: 157, Pages 1 - 25
Abstract
We 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 state-of-the-art method designs an index based on the two-hop cover, and updating the index is costly when new edges arrive. In this paper, we propose a new framework and design a novel forest-based index for historical connectivity queries. The index enables us to answer queries by searching if two vertices are connected in the forest. We update the index by modifying a forest structure. Our techniques also work for connectivity query processing in a sliding window of temporal graphs. Extensive experiments have been conducted to show the considerable advantages of our approach compared with the state-of-the-art methods in both historical connectivity queries and sliding-window connectivity queries.
References
[1]
R. Agrawal, A. Borgida, and H. V. Jagadish. 1989. Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. SIGMOD Rec., Vol. 18, 2 (jun 1989), 253--262. https://doi.org/10.1145/66926.66950
[2]
Kemafor Anyanwu and Amit Sheth. 2003. ρ-Queries: enabling querying for semantic associations on the semantic web. In WWW. 690--699.
[3]
Ramadhana Bramandia, Byron Choi, and Wee Keong Ng. 2010. Incremental Maintenance of 2-Hop Labeling of Large Graphs. IEEE Transactions on Knowledge and Data Engineering, Vol. 22, 5 (2010), 682--698. https://doi.org/10.1109/TKDE.2009.117
[4]
Giuseppe Cattaneo, Pompeo Faruolo, U Ferraro Petrillo, and Giuseppe F Italiano. 2010. Maintaining dynamic minimum spanning trees: An experimental study. Discrete Applied Mathematics, Vol. 158, 5 (2010), 404--425.
[5]
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 (jul 2022), 3263--3276. https://doi.org/10.14778/3551793.3551868
[6]
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 (New York, New York, USA) (SIGMOD '13). Association for Computing Machinery, New York, NY, USA, 193--204. https://doi.org/10.1145/2463676.2465286
[7]
Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2002. Reachability and Distance Queries via 2-Hop Labels. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, California) (SODA '02). Society for Industrial and Applied Mathematics, 937--946.
[8]
Michael S. Crouch, Andrew McGregor, and Daniel M. Stubbs. 2013. Dynamic Graphs in the Sliding-Window Model. In ESA (Lecture Notes in Computer Science, Vol. 8125). 337--348.
[9]
Xiangyang Gou and Lei Zou. 2021. Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges. In SIGMOD. 645--657.
[10]
Monika R. Henzinger and Valerie King. 1997. Maintaining minimum spanning trees in dynamic graphs. In Automata, Languages and Programming, Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 594--604.
[11]
Monika R. Henzinger and Valerie King. 1999. Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation. J. ACM, Vol. 46, 4 (jul 1999), 502--516. https://doi.org/10.1145/320211.320215
[12]
Monika R. Henzinger and Valerie King. 2001. Maintaining Minimum Spanning Forests in Dynamic Graphs. SIAM J. Comput., Vol. 31, 2 (2001), 364--374. https://doi.org/10.1137/S0097539797327209
[13]
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 (jul 2001), 723--760. https://doi.org/10.1145/502090.502095
[14]
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, and Seth Pettie. 2017. Fully Dynamic Connectivity in O(Log n(Log Log n)2) Amortized Expected Time. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Barcelona, Spain) (SODA '17). Society for Industrial and Applied Mathematics, USA, 510--520.
[15]
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 (Providence, Rhode Island, USA) (SIGMOD '09). Association for Computing Machinery, New York, NY, USA, 813--826. https://doi.org/10.1145/1559845.1559930
[16]
Ruoming Jin, Yang Xiang, Ning Ruan, and Haixun Wang. 2008. Efficiently answering reachability queries on very large directed graphs. In SIGMOD. 595--608.
[17]
Bruce M. Kapron, Valerie King, and Ben Mountjoy. 2013. Dynamic Graph Connectivity in Polylogarithmic Worst Case Time. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, Louisiana) (SODA '13). Society for Industrial and Applied Mathematics, USA, 1131--1142.
[18]
Mo Li, Farhana Murtaza Choudhury, Renata Borovica-Gajic, Zhiqiong Wang, Junchang Xin, and Jianxin Li. 2020. CrashSim: An Efficient Algorithm for Computing SimRank over Static and Temporal Graphs. In ICDE. IEEE, 1141--1152.
[19]
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 (Taipei, Taiwan). Springer-Verlag, Berlin, Heidelberg, 761--777. https://doi.org/10.1007/978--3-030--73197--7_52
[20]
Zijun Mao, Hongyun Yao, Qi Zou, Weiting Zhang, and Ying Dong. 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 (2021). https://api.semanticscholar.org/CorpusID:231726592
[21]
Andrew McGregor. 2014. Graph stream algorithms: a survey. SIGMOD Rec., Vol. 43, 1 (2014), 9--20.
[22]
Anil Pacaci, Angela Bonifati, and M. Tamer Ö zsu. 2020. Regular Path Query Evaluation on Streaming Graphs. In SIGMOD. 1415--1430.
[23]
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.
[24]
Liam Roditty and Uri Zwick. 2008. Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput., Vol. 37, 5 (2008), 1455--1471. https://doi.org/10.1137/060650271
[25]
Liam Roditty and Uri Zwick. 2016. A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time. SIAM J. Comput., Vol. 45, 3 (2016), 712--733. https://doi.org/10.1137/13093618X
[26]
Scott Sallinen, Roger Pearce, and Matei Ripeanu. 2019. Incremental Graph Processing for On-line Analytics. In 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS). 1007--1018. https://doi.org/10.1109/IPDPS.2019.00108
[27]
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, Elisa Bertino, Stavros Christodoulakis, Dimitris Plexousakis, Vassilis Christophides, Manolis Koubarakis, Klemens Böhm, and Elena Ferrari (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 237--255.
[28]
R. Schenkel, A. Theobald, and G. 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). 360--371. https://doi.org/10.1109/ICDE.2005.57
[29]
Daniel D. Sleator and Robert Endre Tarjan. 1983. A data structure for dynamic trees. J. Comput. System Sci., Vol. 26, 3 (1983), 362--391. https://doi.org/10.1016/0022-0000(83)90006--5
[30]
Daniel D. Sleator and Robert Endre Tarjan. 1981. A Data Structure for Dynamic Trees. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing (Milwaukee, Wisconsin, USA) (STOC '81). Association for Computing Machinery, New York, NY, USA, 114--122. https://doi.org/10.1145/800076.802464
[31]
Daniel Dominic Sleator and Robert Endre Tarjan. 1985. Self-Adjusting Binary Search Trees. J. ACM, Vol. 32, 3 (jul 1985), 652--686. https://doi.org/10.1145/3828.3835
[32]
R.E. Tarjan and U. Vishkin. 1984. Finding biconnected componemts and computing tree functions in logarithmic parallel time. In 25th Annual Symposium onFoundations of Computer Science, 1984. 12--20. https://doi.org/10.1109/SFCS.1984.715896
[33]
Hao Wei, Jeffrey Xu Yu, Can Lu, and Ruoming Jin. 2014. Reachability querying: an independent permutation labeling approach. The VLDB Journal, Vol. 27 (2014), 1--26.
[34]
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). 1153--1164. https://doi.org/10.1109/ICDE48307.2020.00104
[35]
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.
[36]
Haoxuan Xie, Yixiang Fang, Yuyang Xia, Wensheng Luo, and Chenhao Ma. 2023. On Querying Connected Components in Large Temporal Graphs. Proc. ACM Manag. Data, Vol. 1, 2, Article 170 (jun 2023), 27 pages. https://doi.org/10.1145/3589315
[37]
Hilmi Yildirim, Vineet Chaoji, and Mohammed J. Zaki. 2013. DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs. CoRR, Vol. abs/1301.0977 (2013). showeprint[arXiv]1301.0977 http://arxiv.org/abs/1301.0977
[38]
Jeffrey Xu Yu and Jiefeng Cheng. 2010. Graph Reachability Queries: A Survey. Springer US, Boston, MA, 181--215. https://doi.org/10.1007/978--1--4419--6045-0_6
[39]
Michael Yu, Dong Wen, Lu Qin, Ying Zhang, Wenjie Zhang, and Xuemin Lin. 2021. On Querying Historical K-Cores., Vol. 14, 11 (jul 2021), 2033--2045. https://doi.org/10.14778/3476249.3476260
[40]
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 (Snowbird, Utah, USA) (SIGMOD '14). Association for Computing Machinery, New York, NY, USA, 1323--1334. https://doi.org/10.1145/2588555.2612181
Index Terms
- On Querying Historical Connectivity in Temporal Graphs
Recommendations
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 spanning fan-connectivity of graphs
Let G be a graph. The connectivity of G, @k(G), is the maximum integer k such that there exists a k-container between any two different vertices. A k-container of G between u and v, C"k(u,v), is a set of k-internally-disjoint paths between u and v. A ...
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
June 2024
1953 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: 30 May 2024
Published in PACMMOD Volume 2, Issue 3
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 179Total Downloads
- Downloads (Last 12 months)179
- Downloads (Last 6 weeks)49
Reflects downloads up to 04 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in