Succinct Structure Representations for Efficient Query Optimization (opens in new tab)

arXiv:2603.15465v1 Announce Type: new Abstract: Structural decomposition methods offer powerful theoretical guarantees for join evaluation, yet they are rarely used in real-world query optimizers. A major reason is the difficulty of combining cost-based plan search and structure-based evaluation. In this work, we bridge this gap by introducing meta-decompositions for acyclic queries, a novel representation that succinctly represents all possible join trees and enables their efficient enumera...