A HUBO-based encoding of left-deep join order selection claims DP-equivalent optimality and greedy-level guarantees with fewer variables, but the formal proof and validity constraints are incomplete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Left-Deep Join Order Selection with Higher-Order Unconstrained Binary Optimization on Quantum Computers
A HUBO-based encoding of left-deep join order selection claims DP-equivalent optimality and greedy-level guarantees with fewer variables, but the formal proof and validity constraints are incomplete.