On Sampling from Massive Graph Streams
Summary: GPS is an order-based reservoir sampling framework for graphs, weighting edge samples to optimize subgraph estimation. Separates sampling from estimation (post- and in-stream) with a Martingale-based unbiased estimator; yields <1% error on subgraph counts while using <0.01% of edges. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Nesreen K. Ahmed
- 2. Nick Duffield
- 3. Theodore L. Willke
- 4. Ryan A. Rossi
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,626 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD | 6.0340995e-05 |
| 5,529 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 5.4569473e-05 |
| 10,288 | AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling | 2026 | VLDB | 4.1905499e-05 |
| 10,631 | Efficient and Adaptive Estimation of Local Triadic Coefficients | 2025 | VLDB | 4.1905499e-05 |
| 10,875 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 589 | Estimating PageRank on Graph Streams | 2008 | PODS | 0.00019569121 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 1,466 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 0.00011838607 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,119 | Sampling Algorithms in a Stream Operator | 2005 | SIGMOD | 5.6774637e-05 |
| 1,466 | Space Efficient Mining of Multigraph Streams | 2005 | PODS | 0.00011838607 |
| 11,323 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 4.1905499e-05 |
| 3,067 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6247945e-05 |
| 10,594 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB | 4.1905499e-05 |
| 10,123 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD | 4.1905499e-05 |
| 1,348 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.00012461666 |
| 389 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024649634 |
| 4,883 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8519327e-05 |
| 5,043 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7350154e-05 |