Complete Join Reordering for Null-Intolerant Joins
TaiNing Wang, Yunpeng Niu, Chee-Yong Chan
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Efficient Query Re-optimization with Judicious Subquery SelectionsJunyi Zhao, Huanchen Zhang, Yihan GaoSIGMOD 2023 · 被引用 12 次
- 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 次
- DPconv: Super-Polynomially Faster Join OrderingMihail Stoian, Andreas KipfSIGMOD 2025 · 被引用 5 次
- Quantum-Inspired Digital Annealing for Join OrderingManuel Schönberger, Immanuel Trummer, Wolfgang MauererVLDB 2024 · 被引用 36 次
