GConnect: A Connectivity Index for Massive Disk-Resident Graphs
Summary: GConnect: a connectivity index for massive disk-resident graphs. Edge-sampling yields compact in-memory representations used to build a disk-resident index for fast, approximate minimum-cut queries; 2–3 orders of magnitude faster with minor accuracy loss. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Charu Aggarwal
- 2. Yan Xie
- 3. Philip S. Yu
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,857 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6924202e-05 |
| 5,221 | Relational Approach for Shortest Path Discovery over Large Graphs | 2012 | VLDB | 5.6180753e-05 |
| 7,343 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 4.7511136e-05 |
| 8,630 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 4.4765914e-05 |
| 8,897 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 4.4229886e-05 |
| 11,865 | On Measuring the Lattice of Commonalities Among Several Linked Datasets | 2016 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065421423 |
| 387 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024682268 |
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |
| 1,720 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 0.00010757565 |
| 3,696 | The Web as a graph | 2000 | PODS | 6.829057e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,626 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD | 4.3106273e-05 |
| 1,572 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011296109 |
| 10,988 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1905499e-05 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027077424 |
| 4,726 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.9632682e-05 |
| 6,206 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1522897e-05 |
| 12,049 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1905499e-05 |
| 3,857 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6924202e-05 |
| 4,070 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4739921e-05 |
| 7,874 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB | 4.6263724e-05 |