Query Optimization for Database-Returning Queries

Summary: Provides two enumeration algorithms for ResultDBSemi-Join that solve the Root Node and Tree Folding enumeration problems (RNEP, TFEP), fixing greedy-plan suboptimality. TDResultDB auto-chooses between semi-join and ResultDBDecompose, yielding up to 6× speedups with minimal overhead. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID: 7604
Venue: SIGMOD
Year: 2026
Pagerank: 5.093636e-05
Overall Rank: 10,394 | 28.69%
DOI: 10.1145/3769818

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Simon Rink (Saarland University)
2. Jens Dittrich (Saarland University)

BibTeX Citation

@inproceedings{rink_sigmod26,
        title = {{Query Optimization for Database-Returning Queries}},
        author = {Rink, Simon and Dittrich, Jens},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769818},
        url = {https://dl.acm.org/doi/10.1145/3769818},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
18	How Good Are Query Optimizers, Really?	2016	VLDB	0.00059284255
211	EmptyHeaded: A Relational Engine for Graph Processing	2016	SIGMOD	0.00024797217
411	Worst-case Optimal Join Algorithms	2012	PODS	0.00018902089
814	Hypertree Decompositions: Questions and Answers	2016	PODS	0.00013841737
1,298	Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products	2006	VLDB	0.00011259156
1,727	Optimal Top-Down Join Enumeration	2007	SIGMOD	9.91063e-05
3,070	Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs	2022	VLDB	7.7900444e-05
3,622	Robust Join Processing with Diamond Hardened Joins	2024	VLDB	7.2465862e-05
5,399	Efficient Massively Parallel Join Optimization for Large Queries*	2022	SIGMOD	6.2319315e-05
6,434	Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees	2025	SIGMOD	5.8799421e-05
7,882	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD	5.5237338e-05
9,183	Extending SQL to Return a Subdatabase	2025	SIGMOD	5.3058708e-05
11,354	mutable: A Modern DBMS for Research and Fast Prototyping	2023	CIDR	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,183	Extending SQL to Return a Subdatabase	2025	SIGMOD
2	3,726	Parallelizing Query Optimization	2008	VLDB
3	10,622	Towards Efficient Random-Order Enumeration for Join Queries	2026	VLDB
4	11,261	Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers	2024	VLDB
5	3,813	Query Simplification: Graceful Degradation for Join-Order Optimization	2009	SIGMOD
6	316	Measuring the Complexity of Join Enumeration in Query Optimization	1990	VLDB
7	143	Optimization of Nonrecursive Queries	1986	VLDB
8	6,412	Ranked Enumeration of Join Queries with Projections	2022	VLDB
9	10,296	Succinct Structure Representations for Efficient Query Optimization	2026	SIGMOD
10	2,745	Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries	2020	VLDB