GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams
Summary: GraphZeppelin is a storage-friendly streaming system for dynamic graphs solving connected components with novel linear sketches (CubeSketch). It delivers space-efficient CC, processing millions of updates/sec on graphs far larger than RAM, optimized for dense, large-scale graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. David Tench (Rutgers University)
- 2. Evan West (State University of New York at Stony Brook)
- 3. Victor Zhang (Rutgers University)
- 4. Michael A. Bender (State University of New York at Stony Brook)
- 5. Abiyaz Chowdhury (State University of New York at Stony Brook)
- 6. J. Ahmed Dellas (Rutgers University)
- 7. Martín Farach-Colton (Rutgers University)
- 8. Tyler Seip (MongoDB)
- 9. Kenny Zhang (State University of New York at Stony Brook)
BibTeX Citation
@inproceedings{tench_sigmod22,
title = {{GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams}},
author = {Tench, David and West, Evan and Zhang, Victor and Bender, Michael A. and Chowdhury, Abiyaz and Dellas, J. Ahmed and Farach-Colton, Martín and Seip, Tyler and Zhang, Kenny},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3526146},
url = {https://dl.acm.org/doi/10.1145/3514221.3526146},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 7.0827068e-05 |
| 8,154 | Revisiting the Design of In-Memory Dynamic Graph Storage | 2025 | SIGMOD | 5.4769071e-05 |
| 8,504 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.4132367e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,146 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00011984702 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,322 | ZipG: A Memory-efficient Graph Store for Interactive Queries | 2017 | SIGMOD |
| 2 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 3 | 3,119 | GConnect: A Connectivity Index for Massive Disk-Resident Graphs | 2009 | VLDB |
| 4 | 10,950 | Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing | 2025 | VLDB |
| 5 | 1,911 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 6 | 6,456 | LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR | 2024 | SIGMOD |
| 7 | 1,146 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |
| 8 | 2,377 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB |
| 9 | 4,946 | Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage | 2024 | SIGMOD |
| 10 | 4,739 | Vertex and Hyperedge Connectivity in Dynamic Graph Streams | 2015 | PODS |