Graph Stream Summarization: From Big Bang to Big Crunch
Summary: TCM: graph stream summarization for directed/undirected graphs with sublinear space, linear construction, constant-time per-edge updates via joint node–edge summarization. A graphical sketch binds edge connections and cross-element node relations; enables diverse queries with error bounds and outperforms independent-element sketches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nan Tang (Hamad Bin Khalifa University; Qatar Computing Research Institute)
- 2. Qing Chen (Hamad Bin Khalifa University; Qatar Computing Research Institute)
- 3. Prasenjit Mitra (Hamad Bin Khalifa University; Qatar Computing Research Institute)
BibTeX Citation
@inproceedings{tang_sigmod16,
title = {{Graph Stream Summarization: From Big Bang to Big Crunch}},
author = {Tang, Nan and Chen, Qing and Mitra, Prasenjit},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2915223},
url = {https://dl.acm.org/doi/10.1145/2882903.2915223},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 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 |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 20 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00056944564 |
| 122 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00031260115 |
| 1,336 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011118804 |
| 2,013 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 9.3068345e-05 |
| 2,377 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB | 8.6710302e-05 |
| 3,481 | Tighter Estimation using Bottom k Sketches | 2008 | VLDB | 7.376137e-05 |
| 4,503 | Event Pattern Matching over Graph Streams | 2015 | VLDB | 6.6597953e-05 |
| 4,695 | Graph Synopses, Sketches, and Streams: A Survey | 2012 | VLDB | 6.5587201e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,695 | Graph Synopses, Sketches, and Streams: A Survey | 2012 | VLDB |
| 2 | 4,236 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB |
| 3 | 4,953 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |
| 4 | 4,500 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB |
| 5 | 486 | Efficient Aggregation for Graph Summarization | 2008 | SIGMOD |
| 6 | 6,266 | Utility-Driven Graph Summarization | 2019 | VLDB |
| 7 | 2,377 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB |
| 8 | 9,872 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB |
| 9 | 5,751 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB |
| 10 | 2,013 | Space Efficient Mining of Multigraph Streams | 2005 | PODS |