On Querying Connected Components in Large Temporal Graphs
Summary: Window-CC: a relaxed temporal connected-component model in a fixed time window for both undirected and directed temporal graphs. Online vs index-based queries; optimized indices deliver up to 3x (undirected) and up to 100x (directed) speedups with substantially smaller space than baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Haoxuan Xie (Chinese University of Hong Kong)
- 2. Yixiang Fang (Chinese University of Hong Kong)
- 3. Yuyang Xia (Chinese University of Hong Kong)
- 4. Wensheng Luo (Chinese University of Hong Kong)
- 5. Chenhao Ma (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{xie_sigmod23,
title = {{On Querying Connected Components in Large Temporal Graphs}},
author = {Xie, Haoxuan and Fang, Yixiang and Xia, Yuyang and Luo, Wensheng and Ma, Chenhao},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589315},
url = {https://dl.acm.org/doi/10.1145/3589315},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 476 | Dynamic Query Evaluation Plans | 1989 | SIGMOD | 0.00017640534 |
| 937 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00012977594 |
| 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00011996469 |
| 2,338 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 8.6124366e-05 |
| 3,066 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.6877117e-05 |
| 3,107 | Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees | 2014 | VLDB | 7.6420848e-05 |
| 3,249 | On Querying Historical K-Cores | 2021 | VLDB | 7.4939212e-05 |
| 3,498 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 7.2551144e-05 |
| 7,799 | GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams | 2022 | SIGMOD | 5.4510258e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,249 | On Querying Historical K-Cores | 2021 | VLDB |
| 2 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 3 | 3,328 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 4 | 5,000 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 5 | 8,645 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 6 | 6,767 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 7 | 10,712 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB |
| 8 | 8,318 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 9 | 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 10 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |