JOIN ORDER OPTIMIZATION IN A QUERY OPTIMIZER FOR QUERIES WITH OUTER AND/OR SEMI JOINS

• US 20110055199A1
• Filed: 08/25/2009
• Published: 03/03/2011
• Est. Priority Date: 08/25/2009
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Al-Omari, Awny K., Siddiqui, Kashif A.
• Application Number:
  US12/547,361
• Publication Number:
  US 20110055199A1
• Time in Patent Office: Days
• US Class Current: 707/714
• CPC Class Codes: G06F 16/2456 Join operations

Abstract

A system and method for join order optimization in a query optimizer is disclosed. The method includes receiving a query having a plurality of join operators, including at least one multi-way join between relational operators in the query tree. The join operators include at least one outer-join and/or semi-join. The multi-way-join is transformed to a multi-join operator with a plurality of join back bone children representing the relational operators. The dependencies that occur between the join back bone children are tracked. Join order validity is evaluated based on the tracked dependencies. One or more multi-join rules are applied to the multi-join operator sufficient to generate at least one join subtree when at least one join subtree is determined to have a valid join order.

Claims

1. A method for join order optimization in a query optimizer, comprising:

receiving a query tree having a plurality of join operators including at least one multi-way join forming a join back bone between relational operators in the query tree, wherein the join operators include at least one of an outer-join, a semi-join, and an anti-semi join;

transforming the multi-way-join to a multi-join operator with a plurality of join back bone children representing the relational operators;

tracking dependencies that occur between the join back bone children;

evaluating join order validity based on the tracked dependencies; and

applying one or more multi-join rules to the at least one multi-join operator sufficient to generate at least one join subtree representing a potential join order when the at least one join subtree is determined to have a valid join order.

2. The method of claim 1, wherein tracking dependencies further comprises assigning to each join back bone child (JBBC) having a dependency:

a set of predecessor JBBCs that a given JBBC depends on; and

a set of successor JBBCs that depends on the given JBBC.

3. The method of claim 2, further comprising performing a recursive analysis of the query tree to assign each of the JBBCs having dependencies a set of predicates with predecessors and a set of predicates with successors.

4. The method of claim 3, further comprising analyzing the predicates with predecessors and the predicates with successors to determine dependencies between the JBBCs of the JBB.

5. The method of claim 4, further comprising calculating a left join filter predicate for each JBBC connected via a left joined JBBC, and storing the left join filter predicate in the associated left joined JBBC to enable join enumeration.

6. The method of claim 1, wherein applying one or more multi-join rules to the multi-join operator sufficient to generate at least one join subtree when the at least one join subtree is determined to have a valid join order further comprises applying an enumeration rule to the query tree to form a split subset to generate the at least one join subtree.

7. The method of claim 6, further comprising returning a null value when the split subset is an invalid split such that no subtree is formed.

8. The method of claim 1, wherein applying one or more multi-join rules to the multi-join operator sufficient to generate at least one join subtree when the at least one join subtree is determined to have a valid join order further comprises obtaining a nested join plan having a good key access to a fact table to form a whole left linear join sequence to the query tree having a valid join order.

9. The method of claim 8, further comprising placing the fact table as the left child of the left most join when obtaining the good key access to the nested join is not possible.

10. A computer-implemented method, comprising:

receiving a query tree for a query, the query tree having at least one multi-way join forming a join back bone between relational operators, wherein the join operators include at least one asymmetric join;

transforming the multi-way-join to a multi-join operator with a plurality of join back bone children representing the relational operators;

tracking dependencies that occur between the join back bone children; and

applying one or more multi-join rules to the multi-join operator, when the at least one join subtree is determined to have a valid join order based on the tracked dependencies, sufficient to generate at least one join subtree representing a potential join order.

11. The method of claim 10, wherein tracking dependencies further comprises assigning to each join back bone child (JBBC) having a dependency:

a set of predecessor JBBCs that a given JBBC depends on; and

a set of successor JBBCs that depends on the given JBBC.

12. The method of claim 11, further comprising performing a recursive analysis of the query tree to assign each of the JBBCs having dependencies a set of predicates with predecessors and a set of predicates with successors.

13. The method of claim 12, further comprising analyzing the predicates with predecessors and the predicates with successors to determine dependencies between the JBBCs of the JBB.

14. The method of claim 13, further comprising calculating a left join filter predicate for each JBBC connected via a left joined JBBC, and storing the filter predicate in the associated left joined JBBC to enable join enumeration.

15. A system comprising:

one or more processors;

one or more computer readable media;

computer readable instructions on the one or more computer readable media which, when executed by the one or more processors, cause the one or more processors to implement a method for join order optimization in a query optimizer comprising;

receiving a query tree having a plurality of join operators including at least one multi-way join between relational operators in the query tree, wherein the join operators include at least one of an outer-join, a semi-join, and an anti-semi join;

transforming the multi-way-join to a multi-join operator with a plurality of join back bone children representing the relational operators;

tracking dependencies that occur between the join back bone children;

evaluating join order validity based on the tracked dependencies; and

applying one or more multi-join rules to the multi-join operator sufficient to generate at least one join subtree representing a potential join order when the at least one join subtree is determined to have a valid join order.

16. The system of claim 15, wherein tracking dependencies further comprises assigning to each join back bone child (JBBC) having a dependency:

a set of predecessor JBBCs that a given JBBC depends on; and

a set of successor JBBCs that depends on a given JBBC.

17. The system of claim 16, further comprising performing a recursive analysis of the query tree to assign each of the JBBCs having dependencies a set of predicates with predecessors and a set of predicates with successors.

18. The system of claim 17, further comprising analyzing the predicates with predecessors and the predicates with successors to determine dependencies between the JBBCs of the JBB.

19. The system of claim 18, further comprising calculating a left join filter predicate for each JBBC connected via a left joined JBBC, and storing the filter predicate in the associated left joined JBBC to enable join enumeration.

20. The system of claim 15, wherein applying one or more multi-join rules to the multi-join operator sufficient to generate at least one join subtree when the at least one join subtree is determined to have a valid join order further comprises applying an enumeration rule to the query tree to form a split subset to generate the at least one join subtree.