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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Simon Rink
- 2. Jens Dittrich
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,869 | The Complexity of Transformation-Based Join Enumeration | 1997 | VLDB | 7.9808408e-05 |
| 9,031 | Extending SQL to Return a Subdatabase | 2025 | SIGMOD | 4.4039656e-05 |
| 4,261 | Parallelizing Query Optimization | 2008 | VLDB | 6.31244e-05 |
| 10,324 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB | 4.1945683e-05 |
| 11,053 | Efficient Enumeration of Recursive Plans in Transformation-based Query Optimizers | 2024 | VLDB | 4.1945683e-05 |
| 4,738 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9600502e-05 |
| 423 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB | 0.00023669348 |
| 143 | Optimization of Nonrecursive Queries | 1986 | VLDB | 0.00041510555 |
| 7,166 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.8124491e-05 |
| 3,715 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8220943e-05 |