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 |
|---|---|---|---|---|
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 1,584 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD | 0.00011255801 |
| 1,941 | Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing | 2018 | SIGMOD | 0.00010017745 |
| 2,607 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4630211e-05 |
| 4,020 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 6.5237459e-05 |
| 4,949 | Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs | 2013 | VLDB | 5.8113132e-05 |
| 5,369 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB | 5.5434712e-05 |
| 5,968 | Summarizing Static and Dynamic Big Graphs | 2017 | VLDB | 5.2503253e-05 |
| 6,395 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB | 5.0829204e-05 |
| 8,250 | Stingy Sketch: A Sketch Framework for Accurate and Fast Frequency Estimation | 2022 | VLDB | 4.5506131e-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 |
|---|---|---|---|---|
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 595 | Estimating PageRank on Graph Streams | 2008 | PODS | 0.00019507721 |
| 835 | Finding Frequent Items in Data Streams | 2008 | VLDB | 0.00016109621 |
| 1,064 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD | 0.00014356481 |
| 1,472 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 0.00011828662 |
| 3,928 | Tighter Estimation using Bottom-k Sketches | 2008 | VLDB | 6.6254568e-05 |
| 4,089 | On Dense Pattern Mining in Graph Streams [Extended Abstract] | 2010 | VLDB | 6.4587806e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,369 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB | 5.5434712e-05 |
| 3,839 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD | 6.7120651e-05 |
| 3,041 | Sketching Probabilistic Data Streams | 2007 | SIGMOD | 7.6697078e-05 |
| 2,607 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4630211e-05 |
| 6,138 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.1915368e-05 |
| 1,040 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00014488943 |
| 7,699 | Sketch-based Geometric Monitoring of Distributed Stream Queries | 2013 | VLDB | 4.6746076e-05 |
| 1,392 | Sketching Streams Through the Net: Distributed Approximate Query Tracking | 2005 | VLDB | 0.00012229045 |
| 7,834 | Sketch-based Querying of Distributed Sliding-Window Data Streams | 2012 | VLDB | 4.6382551e-05 |
| 1,064 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD | 0.00014356481 |