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)
Incoming Non-self Citations Over Time
Authors
- 1. Kyoungmin Kim (Pohang University of Science and Technology)
- 2. George Fletcher (Eindhoven University of Technology)
- 3. Hyeonji Kim (Pohang University of Science and Technology)
- 4. Wook-Shin Han (Pohang University of Science and Technology)
BibTeX Citation
@inproceedings{kim_sigmod21,
title = {{Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation}},
author = {Kim, Kyoungmin and Fletcher, George and Kim, Hyeonji and Han, Wook-Shin},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3457246},
url = {https://dl.acm.org/doi/10.1145/3448016.3457246},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,867 | SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning | 2025 | SIGMOD |
| 2 | 11,762 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 3 | 1,536 | Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses | 2018 | VLDB |
| 4 | 5,506 | Accurate and Fast Approximate Graph Pattern Mining at Scale | 2025 | VLDB |
| 5 | 4,613 | On Sampling from Massive Graph Streams | 2017 | VLDB |
| 6 | 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 7 | 3,070 | Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs | 2022 | VLDB |
| 8 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 9 | 5,942 | Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach | 2024 | VLDB |
| 10 | 9,996 | Path-centric Cardinality Estimation for Subgraph Matching | 2025 | VLDB |