Complete Join Reordering for Null-Intolerant Joins
TaiNing Wang, Yunpeng Niu, Chee-Yong Chan
Abstract
The join reordering problem is a core task in query optimization to find the most efficient evaluation order for join operations. The Enhanced Compensation-based Approach (ECA) is the state-of-the-art approach for this problem which is based on using new operators called compensation operators to enlarge the query plan search space with more join reorderings. However, ECA cannot provide complete join reorderability for queries involving one or more full outerjoins. In this paper, we present the first complete join reordering solution, named CJR. By introducing a new and more expressive compensation operator and an enhanced set of rewriting rules, CJR is able to provide complete join reorderability for all join queries with null-intolerant join predicates. Our experimental results on the Join Order Benchmark demonstrate that CJR can improve query performance by a factor of 12.32.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 82922640-02c7-4bf0-b0d1-cd7df8a48865Cited by top-tier papers1
Ask how each one uses itRelated papers
- Efficient Query Re-optimization with Judicious Subquery SelectionsJunyi Zhao, Huanchen Zhang, Yihan GaoSIGMOD 2023 · 12 citations
- AJOSC: Adaptive Join Order Selection for Continuous QueriesXinyi Ye, Xiangyang Gou, Lei Zou, Wenjie ZhangSIGMOD 2025
- LOGER: A Learned Optimizer towards Generating Efficient and Robust Query Execution PlansTianyi Chen, Jun Gao, Hedui Chen, Yaofeng TuVLDB 2023 · 54 citations
- DPconv: Super-Polynomially Faster Join OrderingMihail Stoian, Andreas KipfSIGMOD 2025 · 5 citations
- Quantum-Inspired Digital Annealing for Join OrderingManuel Schönberger, Immanuel Trummer, Wolfgang MauererVLDB 2024 · 36 citations
