DBScholar

Back to papers

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)

Paper ID
1927
Venue
PODS
Year
2023
Pagerank
7.0074268e-05
Overall Rank
3,941 | 72.97%
DOI
10.1145/3584372.3588676

Incoming Non-self Citations Over Time

Authors

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.

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