Back to papers
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation
Summary: ALLEY blends sampling and synopses for graph-pattern cardinality estimation. It introduces random-walk-with-intersection sampling, variance-reducing branching, and mined tangled-pattern synopses to deliver unbiased online estimates with worst-case optimal runtime and accuracy guarantees.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6137
- Venue
- SIGMOD
- Year
- 2021
- Pagerank
- 4.9554912e-05
- Overall Rank
- 6,704 | 53.37%
- DOI
-
10.1145/3448016.3457246
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 203 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034889335 |
| 342 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026795977 |
| 502 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021526612 |
| 613 |
Design and Implementation of the LogicBlox System |
2015 |
SIGMOD |
0.00019181325 |
| 629 |
Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors |
2009 |
VLDB |
0.00018942366 |
| 943 |
Wander Join: Online Aggregation via Random Walks |
2016 |
SIGMOD |
0.00015145883 |
| 1,046 |
Estimating the Selectivity of XML Path Expressions for Internet Scale Applications |
2001 |
VLDB |
0.00014462307 |
| 1,089 |
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph |
2014 |
VLDB |
0.00014157922 |
| 1,105 |
Cardinality Estimation Done Right: Index-Based Join Sampling |
2017 |
CIDR |
0.00013990395 |
| 1,193 |
Join Size Estimation Subject to Filter Conditions |
2015 |
VLDB |
0.00013414989 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,369 |
Random Sampling over Joins Revisited |
2018 |
SIGMOD |
0.00012339777 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,756 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.00010664542 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 2,142 |
Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities |
2019 |
SIGMOD |
9.4507296e-05 |
| 2,356 |
Consistently Estimating the Selectivity of Conjuncts of Predicates |
2005 |
VLDB |
8.9620762e-05 |
| 3,646 |
G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching |
2020 |
SIGMOD |
6.8853079e-05 |
| 5,877 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2916612e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,728 |
SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning |
2025 |
SIGMOD |
4.2942813e-05 |
| 11,565 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1945683e-05 |
| 1,981 |
Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses |
2018 |
VLDB |
9.8687545e-05 |
| 7,317 |
Accurate and Fast Approximate Graph Pattern Mining at Scale |
2025 |
VLDB |
4.7639399e-05 |
| 4,898 |
On Sampling from Massive Graph Streams |
2017 |
VLDB |
5.8459467e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 3,511 |
Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs |
2022 |
VLDB |
7.0254052e-05 |
| 11,559 |
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees |
2020 |
SIGMOD |
4.1945683e-05 |
| 6,289 |
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach |
2024 |
VLDB |
5.1275309e-05 |
| 9,845 |
Path-centric Cardinality Estimation for Subgraph Matching |
2025 |
VLDB |
4.2721228e-05 |