Optimizing Join Orders via Constrained Quadratic Models (Abstract)

This abstract summarizes the core ideas presented in [2]. The join order (JO) optimization problem is an NP-hard combinatorial challenge in query optimization. It aims to find the most efficient sequence for joining multiple relations. Dynamic programming (DP) provides optimal solutions for small queries but becomes impractical for larger ones due to its exponential complexity. Heuristic methods balance between quality and efficiency. The JO problem has recently been explored with Quantum Computing, which relies on the Quadratic Unconstrained Binary Optimization (QUBO) [4].