DBScholar

Back to papers

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)

Paper ID
6520
Venue
SIGMOD
Year
2022
Pagerank
5.5761394e-05
Overall Rank
7,647 | 47.54%
DOI
10.1145/3514221.3526146

Incoming Non-self Citations Over Time

Authors

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.

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