GConnect: A Connectivity Index for Massive Disk-Resident Graphs
Summary: GConnect indexes massive disk-resident graphs using edge-sampled, compressed representations that fit in memory while organizing them in a disk-resident structure. It approximates pairwise minimum cuts 100–1000× faster than direct disk processing, with modest accuracy loss. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Charu Aggarwal (International Business Machines T. J. Watson Research Center)
- 2. Yan Xie (University of Illinois Chicago)
- 3. Philip S. Yu (University of Illinois Chicago)
BibTeX Citation
@article{aggarwal_vldb09,
title = {{GConnect: A Connectivity Index for Massive Disk-Resident Graphs}},
author = {Aggarwal, Charu and Xie, Yan and Yu, Philip S.},
journal = {PVLDB},
series = {{VLDB} '09},
doi = {10.14778/1687627.1687725},
url = {https://doi.org/10.14778/1687627.1687725},
year = {2009}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 7.5853837e-05 |
| 4,977 | Relational Approach for Shortest Path Discovery over Large Graphs | 2012 | VLDB | 6.4166233e-05 |
| 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 5.8486743e-05 |
| 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 5.3984824e-05 |
| 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 5.3251649e-05 |
| 12,058 | On Measuring the Lattice of Commonalities Among Several Linked Datasets | 2016 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 138 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00029823423 |
| 548 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00016694936 |
| 591 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.0001603683 |
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
| 4,015 | The Web as a graph | 2000 | PODS | 6.9542071e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,759 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD |
| 2 | 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD |
| 3 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 4 | 322 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD |
| 5 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 6 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 7 | 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 8 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 9 | 3,857 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD |
| 10 | 7,862 | ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms | 2021 | VLDB |