Database Paper Browser

Back to papers

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
7414
Venue
SIGMOD
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,104 | 29.71%
DOI
10.1145/3769818

Incoming Non-self Citations Over Time

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

Authors

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