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
- 2. Charu C. Aggarwal
- 3. Min Wang
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 1,586 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD | 0.00011245213 |
| 1,944 | Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing | 2018 | SIGMOD | 0.00010008078 |
| 2,609 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4587236e-05 |
| 4,025 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 6.5174688e-05 |
| 4,955 | Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs | 2013 | VLDB | 5.8057282e-05 |
| 5,377 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB | 5.5381456e-05 |
| 5,975 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 5.2452824e-05 |
| 6,391 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB | 5.0780425e-05 |
| 8,246 | Stingy Sketch: A Sketch Framework for Accurate and Fast Frequency Estimation | 2022 | VLDB | 4.5462498e-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 |
|---|---|---|---|---|
| 168 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.0003915627 |
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 589 | Estimating PageRank on Graph Streams | 2008 | PODS | 0.00019569121 |
| 831 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00016094846 |
| 1,065 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD | 0.00014344675 |
| 1,466 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 0.00011838607 |
| 3,930 | Tighter Estimation using Bottom-k Sketches | 2008 | VLDB | 6.6195837e-05 |
| 4,092 | On Dense Pattern Mining in Graph Streams [Extended Abstract] | 2010 | VLDB | 6.4525563e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,377 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB | 5.5381456e-05 |
| 3,840 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD | 6.7098606e-05 |
| 3,047 | Sketching Probabilistic Data Streams | 2007 | SIGMOD | 7.6537004e-05 |
| 2,609 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4587236e-05 |
| 6,144 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.1865526e-05 |
| 922 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00015254436 |
| 7,697 | Sketch-based Geometric Monitoring of Distributed Stream Queries | 2013 | VLDB | 4.6701245e-05 |
| 1,394 | Sketching Streams Through the Net: Distributed Approximate Query Tracking | 2005 | VLDB | 0.00012218557 |
| 7,839 | Sketch-based Querying of Distributed Sliding-Window Data Streams | 2012 | VLDB | 4.6338068e-05 |
| 1,065 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD | 0.00014344675 |