Cited By
View all- Wang TNiu YChan C(2023)Complete Join Reordering for Null-Intolerant Joins2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00136(1734-1746)Online publication date: Apr-2023
Improving Join Reorderability with Compensation Operators
Pages 693 - 708
Abstract
A critical task in query optimization is the join reordering problem which is to find an efficient evaluation order for the join operators in a query plan. While the join reordering problem is well studied for queries with only inner-joins, the problem becomes considerably harder when outerjoins/antijoins are involved as such operators are generally not associative. The existing solutions for this problem do not enumerate the complete space of join orderings due to various restrictions on the query rewriting rules considered. In this paper, we present a novel approach for this problem for the class of queries involving inner-joins, single-sided outerjoins, and/or antijoins. Our work is able to support complete join reorderability for this class of queries which supersedes the state-of-the-art approaches.
References
[1]
Gautam Bhargava, Piyush Goel, and Bala Iyer. 1995. Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates ACM SIGMOD. 304--315.
[2]
Umeshwar Dayal. 1987. Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers VLDB. 197--208.
[3]
Pit Fender and Guido Moerkotte. 2013. Counter strike: generic top-down join enumeration for hypergraphs. Proceedings of the VLDB Endowment Vol. 6, 14 (2013), 1822--1833.
[4]
César Galindo-Legaria and Arnon Rosenthal. 1992. How to extend a conventional optimizer to handle one- and two-sided outerjoin IEEE ICDE. 402--409.
[5]
César Galindo-Legaria and Arnon Rosenthal. 1997. Outerjoin Simplification and Reordering for Query Optimization. ACM TODS, Vol. 22, 1 (March . 1997), 43--74.
[6]
Cesar Alejandro Galindo-Legaria. 1992. Algebraic optimization of outerjoin queries. Ph.D. Dissertation. Harvard University.
[7]
Gerhard Hill and Andrew Ross. 2009. Reducing Outer Joins. VLDB Journal, Vol. 18, 3 (June . 2009), 599--610.
[8]
Guido Moerkotte, Pit Fender, and Marius Eich. 2013. On the correct and complete enumeration of the core search space ACM SIGMOD. 493--504.
[9]
Guido Moerkotte and Thomas Neumann. 2008. Dynamic Programming Strikes Back. In ACM SIGMOD. 539--552.
[10]
Jun Rao, Bruce G. Lindsay, Guy M. Lohman, Hamid Pirahesh, and David E. Simmen. 2000. Using EELs, a Practical Approach to Outerjoin and Antijoin Reordering. Technical Report RJ 10203. IBM Research Division.
[11]
Jun Rao, Bruce G. Lindsay, Guy M. Lohman, Hamid Pirahesh, and David E. Simmen. 2001. Using EELs, a Practical Approach to Outerjoin and Antijoin Reordering IEEE ICDE. 585--594.
[12]
Jun Rao, Hamid Pirahesh, and Calisto Zuzarte. 2004. Canonical Abstraction for Outerjoin Optimization. ACM SIGMOD. 671--682.
[13]
Arnon Rosenthal and Cesar Galindo-Legaria. 1990. Query Graphs, Implementing Trees, and Freely-reorderable Outerjoins ACM SIGMOD. 291--299.
[14]
Arnon Rosenthal and David S. Reiner. 1984. Extending the Algebraic Framework of Query Processing to Handle Outerjoins VLDB. 334--343.
[15]
P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. 1979. Access Path Selection in a Relational Database Management System ACM SIGMOD. 23--34.
Index Terms
- Improving Join Reorderability with Compensation Operators
Recommendations
Wander Join: Online Aggregation for Joins
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJoins are expensive, and online aggregation over joins was proposed to mitigate the cost, which offers a nice and flexible tradeoff between query efficiency and accuracy in a continuous, online fashion. However, the state-of-the-art approach, in both ...
Coral: federated query join order optimization based on deep reinforcement learning
AbstractThe rise of diversified data engines has created the need for federated queries. A federated query can take a query and provide data analysis based on data from various data engines. Since the query data originates from multiple data engines, ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Comments
Information & Contributors
Information
Published In
May 2018
1874 pages
ISBN:9781450347037
DOI:10.1145/3183713
- General Chairs:
- Gautam Das,
- Christopher Jermaine,
- Philip Bernstein
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 May 2018
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Ministry of Education - Singapore
Conference
SIGMOD/PODS '18
Sponsor:
Acceptance Rates
SIGMOD '18 Paper Acceptance Rate 90 of 461 submissions, 20%;
Overall Acceptance Rate 785 of 4,003 submissions, 20%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 421Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)4
Reflects downloads up to 27 Feb 2025
Other Metrics
Citations
Cited By
View all- Wang TNiu YChan C(2023)Complete Join Reordering for Null-Intolerant Joins2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00136(1734-1746)Online publication date: Apr-2023
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in