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: 1895
Venue: PODS
Year: 2023
Pagerank: 5.7040225e-05
Overall Rank: 5,085 | 64.66%
DOI: 10.1145/3584372.3588676

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,521	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	4.4893996e-05
8,964	Reservoir Sampling over Joins	2024	SIGMOD	4.4163852e-05
10,009	The Space-Time Complexity of Sum-Product Queries	2026	PODS	4.1905499e-05
10,336	Towards Efficient Random-Order Enumeration for Join Queries	2026	VLDB	4.1905499e-05
10,354	An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication	2025	PODS	4.1905499e-05
10,389	FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds	2025	SIGMOD	4.1905499e-05
10,493	Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized	2025	SIGMOD	4.1905499e-05
11,135	A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition	2024	VLDB	4.1905499e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
31	Provenance Semirings	2007	PODS	0.00078516827
71	How Good Are Query Optimizers, Really?	2016	VLDB	0.00059446482
341	EmptyHeaded: A Relational Engine for Graph Processing	2016	SIGMOD	0.00026850764
503	Worst-case Optimal Join Algorithms	2012	PODS	0.00021517145
564	FAQ: Questions Asked Frequently	2016	PODS	0.00020002796
941	Wander Join: Online Aggregation via Random Walks	2016	SIGMOD	0.00015147831
1,322	Hypertree Decompositions: Questions and Answers	2016	PODS	0.00012595941
1,372	Random Sampling over Joins Revisited	2018	SIGMOD	0.0001233325
1,452	What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?	2017	PODS	0.00011922523
2,173	AJAR: Aggregations and Joins over Annotated Relations	2016	PODS	9.3767985e-05
3,386	Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration	2020	PODS	7.151562e-05
4,926	On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms	2023	PODS	5.8184457e-05
6,705	Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation	2021	SIGMOD	4.9507418e-05
8,994	Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations	2022	PODS	4.4094348e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
8,964	Reservoir Sampling over Joins	2024	SIGMOD	4.4163852e-05
1,194	Join Size Estimation Subject to Filter Conditions	2015	VLDB	0.00013411666
10,336	Towards Efficient Random-Order Enumeration for Join Queries	2026	VLDB	4.1905499e-05
7,337	Join Size Bounds using l_p-Norms on Degree Sequences	2024	PODS	4.7532633e-05
1,019	An Instant and Accurate Size Estimation Method for Joins and Selection in a Retrieval-Intensive Environment	1993	SIGMOD	0.00014623543
550	Tracking Join and Self-Join Sizes in Limited Storage	1999	PODS	0.00020346247
11,449	Index-Based Join Size Estimation Using Adaptive Sampling	2021	SIGMOD	4.1905499e-05
2,254	Two-Level Sampling for Join Size Estimation	2017	SIGMOD	9.1871115e-05
4,926	On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms	2023	PODS	5.8184457e-05
751	Query Size Estimation by Adaptive Sampling (Extended Abstract)	1990	PODS	0.00017155121