Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins
Summary: First method guaranteeing arbitrarily-small-error uniform sampling and join-size estimation for arbitrary (acyclic/cyclic, binary/non-binary) queries in O~(AGM/OUT) time w.h.p. Requires linear-time indexes, unifies prior estimators, and uses GHDs to improve when OUT is tiny. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kyoungmin Kim (Pohang University of Science and Technology)
- 2. Jaehyun Ha (Pohang University of Science and Technology)
- 3. George Fletcher (Eindhoven University of Technology)
- 4. Wook-Shin Han (Pohang University of Science and Technology)
BibTeX Citation
@inproceedings{kim_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Guaranteeing the O\~{}(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588676},
doi = {10.1145/3584372.3588676},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kim, Kyoungmin and Ha, Jaehyun and Fletcher, George and Han, Wook-Shin},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,335 | Reservoir Sampling over Joins | 2024 | SIGMOD | 5.64193e-05 |
| 8,724 | FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds | 2025 | SIGMOD | 5.3766157e-05 |
| 8,728 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS | 5.3766157e-05 |
| 9,048 | An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication | 2025 | PODS | 5.3251649e-05 |
| 9,719 | Subset Sampling over Joins | 2026 | PODS | 5.2319816e-05 |
| 10,169 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS | 5.093636e-05 |
| 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 5.093636e-05 |
| 10,622 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB | 5.093636e-05 |
| 10,762 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD | 5.093636e-05 |
| 11,338 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 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 | 737 | Join Size Estimation Subject to Filter Conditions | 2015 | VLDB |
| 2 | 10,622 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB |
| 3 | 6,257 | Join Size Bounds using l_p-Norms on Degree Sequences | 2024 | PODS |
| 4 | 1,172 | An Instant and Accurate Size Estimation Method for Joins and Selection in a Retrieval-Intensive Environment | 1993 | SIGMOD |
| 5 | 418 | Tracking Join and Self-Join Sizes in Limited Storage | 1999 | PODS |
| 6 | 11,644 | Index-Based Join Size Estimation Using Adaptive Sampling | 2021 | SIGMOD |
| 7 | 1,664 | Two-Level Sampling for Join Size Estimation | 2017 | SIGMOD |
| 8 | 10,169 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS |
| 9 | 3,453 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS |
| 10 | 992 | Query Size Estimation by Adaptive Sampling (Extended Abstract) | 1990 | PODS |