gSketch: On Query Estimation in Graph Streams
Summary: gSketch fuses traditional stream synopses with partitioned sketches to estimate queries on evolving graphs. It splits a global sketch into localized sketches to optimize accuracy under two scenarios: stream-only sampling, and joint stream+workload sampling, outperforming global baselines on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Peixiang Zhao (University of Illinois Urbana-Champaign)
- 2. Charu C. Aggarwal (IBM)
- 3. Min Wang (Hewlett Packard Enterprise)
BibTeX Citation
@article{zhao_vldb12,
title = {{gSketch: On Query Estimation in Graph Streams}},
author = {Zhao, Peixiang and Aggarwal, Charu C. and Wang, Min},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {3},
pages = {193--204},
doi = {10.14778/2078324.2078332},
url = {https://doi.org/10.14778/2078324.2078332},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 599 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015700433 |
| 1,329 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD | 0.00011013041 |
| 1,903 | Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing | 2018 | SIGMOD | 9.383454e-05 |
| 2,202 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.861907e-05 |
| 3,677 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.0870914e-05 |
| 4,938 | Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs | 2013 | VLDB | 6.3327465e-05 |
| 5,005 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB | 6.3061786e-05 |
| 5,628 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 6.0438005e-05 |
| 5,995 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB | 5.903845e-05 |
| 7,657 | Stingy Sketch: A Sketch Framework for Accurate and Fast Frequency Estimation | 2022 | VLDB | 5.456693e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00030503973 |
| 465 | Counting Triangles in Data Streams | 2006 | PODS | 0.00017754185 |
| 844 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD | 0.00013498392 |
| 911 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00013093314 |
| 1,418 | Estimating PageRank on Graph Streams | 2008 | PODS | 0.00010705931 |
| 2,063 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 9.0815237e-05 |
| 3,549 | Tighter Estimation using Bottom k Sketches | 2008 | VLDB | 7.1896874e-05 |
| 4,323 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB | 6.650678e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,381 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD |
| 2 | 2,749 | Sketching Probabilistic Data Streams | 2007 | SIGMOD |
| 3 | 2,202 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 4 | 5,893 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD |
| 5 | 1,153 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |
| 6 | 7,935 | Sketch-based Geometric Monitoring of Distributed Stream Queries | 2013 | VLDB |
| 7 | 10,578 | Sketch-based Secure Query Processing for Streaming Data | 2026 | SIGMOD |
| 8 | 1,070 | Sketching Streams Through the Net: Distributed Approximate Query Tracking | 2005 | VLDB |
| 9 | 7,889 | Sketch-based Querying of Distributed Sliding-Window Data Streams | 2012 | VLDB |
| 10 | 844 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD |