Patent Grant
10127277
The present invention relates to computer database management systems, and more particularly to the optimization and transformation of database queries that include OUTER JOIN operations.
Computer systems incorporating Relational DataBase Management System (RDBMS) software using a Structured Query Language (SQL) interface are well known in the art. The SQL interface has evolved into a standard language for RDBMS software and has been adopted as such by both the American Nationals Standard Organization (ANSI) and the International Standards Organization (ISO).
In RDBMS software, all data is externally structured into tables. The SQL interface allows users to formulate relational operations on the tables either interactively, in batch files, or embedded in host languages such as C, COBOL, etc. Operators are provided in SQL that allow the user to manipulate the data, wherein each operator operates on either one or two tables and produces a new table as a result. The power of SQL lies on its ability to link information from multiple tables or views together to perform complex sets of procedures with a single statement.
SQL supports OUTER JOIN and INNER JOIN operations. The semantics of the OUTER JOIN operation are outlined as follows. An OUTER JOIN involves a join of two tables, which are referred to as the left table and the right table. An OUTER JOIN is a modification of an INNER JOIN in that it preserves all information from one or both of the input relations.
An outer join can be further categorized into left, right (single-sided), or full (two-sided) OUTER JOIN, depending on which side needs to be preserved. These operations have two operands, the left and right tables. If tuples of both tables are preserved, then the operation is called FULL OUTER JOIN. If the tuples of only one table are preserved, e.g., the left table or the right table, then the result is respectively a LEFT OUTER JOIN or a RIGHT OUTER JOIN. In the output or answer set, for the non-matching tuples of a preserved table, NULL values are assigned to the columns of the other table.
A SQL query that is submitted to the RDBMS is analyzed by a query optimizer. Based on the analysis, the query optimizer generates an execution plan optimized for efficient execution. The optimized execution plan may be based on a rewrite of the query. One technique for SQL query optimization involves simplifying queries based on the nature of null-intolerant predicates.
According to one embodiment of the present invention, a method is provided for processing a structured query language (SQL) statement, the SQL statement comprising at least an OUTER JOIN operation, the method comprising: determining, by one or more computer processors, whether a first query and a second query are equivalent, the first and second queries being respectively the left side and the right side operands of the OUTER JOIN operation; determining, by one or more computer processors, whether a SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation; and responsive to determining that the first query and the second query are equivalent and that the SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation, transforming, by one or more computer processors, the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation.
According to another embodiment of the present invention, a computer program product is provided for processing a structured query language (SQL) statement, the SQL statement comprising at least an OUTER JOIN operation, the computer program product comprising: one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising program instructions to: determine whether a first query and a second query are equivalent, the first and second queries being respectively the left side and the right side operands of the OUTER JOIN operation; determine whether a SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation; and responsive to determining that the first query and the second query are equivalent and that the SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation, transform the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation.
According to another embodiment of the present invention, a computer system is provided for processing a structured query language (SQL) statement, the SQL statement comprising at least an OUTER JOIN operation, the computer system comprising: one or more computer processors; one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising program instructions to: determine whether a first query and a second query are equivalent, the first and second queries being respectively the left side and the right side operands of the OUTER JOIN operation; determine whether a SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation; and responsive to determining that the first query and the second query are equivalent and that the SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation, transform the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation.
Preferred embodiments of the present invention will now be described in more detail, by way of example only, with reference to the accompanying drawings, in which:
In certain embodiments of the invention, query processor 120 receives an SQL query 104 that comprises at least an OUTER JOIN operation. Query processor 120 determines whether a first query and a second query are “equivalent”, the first and second queries being respectively the left side and the right side operands of the OUTER JOIN operation. The meaning of “equivalent” is defined below. Query processor 120 can also determine whether the SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation. Furthermore, query processor 120 can, responsive to determining that the first query and a second query are “equivalent” and that the SELECT output of the SQL statement does not refer to database columns from the left side of the OUTER JOIN operation which are not also partitioning columns of the OUTER JOIN operation, transform the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation.
Before describing embodiments of the invention in detail, a few definitions will be provided.
Two queries, or subqueries, are “equivalent” if they produce the same multi-set results. A “multi-set” is a collection of unordered objects that may include duplicate objects. The result of an SQL query, for example, is generally a multi-set unless it has been specified that the query returns distinct and/or ordered results. The two queries are equivalent (but not “exactly” equivalent) when one query contains or is contained by the other query, that is, one query subsumes or is subsumed by the other query, which means that each row from the first query is equivalent to one row from the second query, but the second query can, for example, have duplicates rows. The two queries are “exactly” equivalent when each row from the first query is equivalent to one row and only one row from the second query.
A query or subquery X “contains” another query or subquery Y, if the result of Y is a subset of the result of X. In this case, X is called the “container” query or subquery, and Y is called the “contained” query or subquery.
A multiple distinct aggregate type query is any query with multiple aggregation functions in the select list where the DISTINCT clause is specified on two or more different columns. For example:
Embodiments of the present invention provide enhancements to database query optimization. Detection of the fact that the inner data is sufficient to fulfill the query may be used to optimize queries by the elimination of unnecessary OUTER JOINs. Where the inner table contains the set of columns specified in the OUTER JOIN selection, the OUTER JOIN can be eliminated, thus dramatically improving the performance of the query.
In a simplistic example, take two tables A & B, with table A containing columns V, W and X and table B containing columns X, Y and Z. Consider a query “SELECT V, W, X FROM A FULL OUTER JOIN B ON A.X=B.X”. The OUTER JOIN can be optimized out since the values or V, W and X can be taken from the inner table A. While very carefully written SQL can avoid the need to use this optimization, it is often the case that SQL statements are complex and such possible optimizations are not obvious to the human eye. Additionally, SQL generators often will not create the most efficient SQL statements and optimization within the query engine is desirable.
In the following description of embodiments of the invention, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that embodiments of the present invention may be practiced without these specific details.
In a first embodiment of the invention, an equality operation, a database user, in order to extract specific employee order details from the tables employee and employee_order of
Starting with the (SELECT * FROM employee_order) AS emp_order portion, this selects all columns from the employee_order table and creates a table alias of emp_order for the selection.
The (SELECT emp_id, salary FROM employee) AS emp_salary portion selects only the emp_id and salary columns from the employee table and creates a table alias of emp_salary for the selection.
The FULL OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the table that lacks a matching row. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected
The SELECT emp_salary.emp_id, emp_order.order FROM portion selects only the emp_salary.emp_id, emp_order.order columns to produce the following output.
The first embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version.
The accuracy of this optimization depends on the fact that, with respect to the OUTER JOIN predicate 312, that is emp_salary.emp_id=emp_order.emp_id, the left quantifier 306, that is employee_order corresponds with one row and only one row from the table represented by the right quantifier 308, that is employee. In the absence of a correspondence, the values associated with columns quantified by the right quantifier 308 are nulls. Since no column quantified by the right quantifier 308 is projected out, the query's result is indiscriminate with respect to a correspondence or the absence of a correspondence. Therefore, the right quantifier 308 can be eliminated from the query. The query result is hence one row per input tuple of the left quantifier, which is equivalent to a simple select over the left quantifier.
At step 406, query processor 120 determines whether the first query 302 and the second query 304 are exactly “equivalent” the first 302 and second 304 queries being respectively the left side and the right side operands of the OUTER JOIN operation. Two queries, or subqueries, are “equivalent” if they produce the same multi-set results. A multi-set is a collection of unordered objects that may include duplicate objects. The results of an SQL query, for example, is generally a multi-set unless it has been specified that the query returns distinct and/or ordered results. In the example of the first embodiment, the check for whether the first query 302 and the second query 304 are exactly “equivalent” is between (SELECT * FROM employee_order) and (SELECT emp_id,salary FROM employee). Although employee_order table does not contain a salary column, each row in (SELECT * FROM employee_order) is equivalent to one row and only one row from the second query (SELECT emp_id, salary FROM employee). Responsive to a negative determination, processing proceeds through connector B to step 414 in
In some instances, the check at step 406 can be relaxed. Techniques to validate equivalence of multi-set results may be adopted in commercial database compilers, and it can be detected when a specific multi-set contains or is contained by another multi-set.
At step 408, query processor 120 determines whether the SELECT output of the query does not refer to database columns from the left side of the OUTER JOIN (emp_salary.emp_id and emp_order.emp_id) which are not also partitioning columns (emp_salary.emp_id and emp_order.emp_id) of the OUTER JOIN operation. The SELECT output refers to the emp_id and order columns. Responsive to a negative determination, processing proceeds through connector B to step 414 in
At step 410, query processor 120 checks whether the OUTER JOIN operation is represented as one of a FULL OUTER JOIN, a RIGHT OUTER JOIN or a LEFT OUTER JOIN. Responsive to a negative determination, processing proceeds through connector B to step 414 in
Referring to
Removing the emp_order alias, replacing emp_salary.emp_id with the corresponding column emp_order.emp_id and adding the condition that emp_id IS NOT NULL simplifies the query to:
The method ends at step 412.
To formulate a more general definition provided by the first embodiment, an outer join can be removed from an SQL statement that includes a first query and a second query, wherein the first query and second query are respectively the left side and the right side operands of a OUTER JOIN operation, wherein the OUTER JOIN operation may include a FULL OUTER JOIN, a LEFT OUTER JOIN or a RIGHT OUTER JOIN, if:
In a second embodiment of the invention, an equality operation over multiple distinct aggregation may be optimized. If the left hand qualifier will still correspond with one row and only one row from the table represented by the right quantifier, then OUTER JOIN elimination can still be performed. The following query Q3 is an example of a query that may be optimized using the second embodiment.
Starting with the (SELECT emp_id, MIN (DISTINCT salary) AS min_salary, MAX(DISTINCT salary) AS max_salary, SUM(salary) AS sum_salary FROM employee GROUP BY emp_id) AS emp_salary portion, this selects four items from the employee table and groups them by emp_id. The first column selected is emp_id. The second selection is MIN (DISTINCT salary) which is the minimum value in the salary column and is given an alias of min-salary. The third selection is MAX (DISTINCT salary) which is the maximum value in the salary column and is given an alias of max_salary. The fourth selection is SUM (salary) which is the total of all entries for the salary column and is given the alias sum_salary.
The (SELECT * FROM employee_order) AS emp_order portion selects all columns from the employee_order table and creates a table alias of emp_order for the selection.
The FULL OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the table that lacks a matching row. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The SELECT emp_salary.emp_id, min_salary, max_salary, sum_salary FROM portion selects only the emp_salary.emp_id, min_salary, max_salary and sum_salary columns to produce the following output:
The second embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version:
At step 504, query processor 120 carries out steps 404 to 408 of
At step 506, query processor 120 determines whether the output of the right side of the OUTER JOIN operation contains the output of the left side of the OUTER JOIN operation. The output of the right side of the OUTER JOIN operation is all of the columns from the employee_order table. The output of the left side of the OUTER JOIN operation is the emp_id, MIN(DISTINCT salary), MAX(DISTINCT salary) and SUM (salary) columns from the employee table. Responsive to a negative determination, processing proceeds through connector D to step 414 in
Referring to
At step 412, query processor 120 transforms the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation and results in a statement of:
The method ends at step 414.
To formulate a more general definition provided by the second embodiment, an outer join can be removed from an SQL statement that includes a first query and a second query, wherein the first query and second query are respectively the left side and the right side operands of a OUTER JOIN operation, wherein the OUTER JOIN operation may include a FULL OUTER JOIN, a LEFT OUTER JOIN or a RIGHT OUTER JOIN, and the columns quantified by the right side of the outer join can include multiple distinct aggregation operations, multiple aggregation operations or a composition of both, if:
In a third embodiment of the invention, an equality operation over multiple distinct aggregation with GROUP BY may be optimized. When the output quantified by the left side of the OUTER JOIN contains the output quantified by the right side of the OUTER JOIN where the provided gap is supported by a GROUP BY operation, it is still possible to perform OUTER JOIN elimination. The following query Q5 is an example of a query that may be optimized using the third embodiment.
Starting with the (SELECT emp_id, MIN (DISTINCT salary) AS min_salary, MAX(DISTINCT salary) AS max_salary, SUM(salary) AS sum_salary FROM employee GROUP BY emp_id) AS emp_salary portion, this selects four columns from the employee table, creates a table alias of emp_salary for the selection and groups them by emp_id.
The (SELECT emp_id, AVG (DISTINCT order) AS avg_order FROM employee_order GROUP BY emp_id portion selects two columns from the employee_order table, creates a table alias of avg_order for the selection and groups the result by emp_id.
The FULL OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the table that lacks a matching row. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The SELECT emp_salary.emp_id, min_salary, max_salary, sum_salary FROM portion selects only the emp_salary.emp_id, min-salary, max_salary and sum_salary columns to produce the following output:
The third embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version.
At step 604, query processor 120 carries out steps 504 to 512 of
At step 412, query processor 120 transforms the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation and results in a statement of:
The method ends at step 414.
To formulate a more general definition provided by the third embodiment, an outer join can be removed from an SQL statement that includes a first query and a second query, wherein the first query and second query are respectively the left side and the right side operands of a OUTER JOIN operation, wherein the OUTER JOIN operation may include a FULL OUTER JOIN, a LEFT OUTER JOIN or a RIGHT OUTER JOIN, and the output quantified by the left side of the outer join contains the output quantified by the right side of the outer join where the provided gap is supported by a group by operation, if:
In a fourth embodiment of the invention, an equality operation without match may be optimized. In the case where the two queries are still “equivalent” but the output quantified by the left side of the outer join does not match the output quantified by the right side of the outer join, outer join elimination may still be performed. In the following example, the output quantified by the right side of the outer join contains information only about employee ID 4, and the output quantified by the left side of the outer join contains information about all the employees. The following query Q7 is an example of a query that may be optimized using the third embodiment.
Starting with the (SELECT emp_id, MAX (DISTINCT salary) AS max_salary FROM employee GROUP BY emp_id) AS emp_salary portion, this selects two columns from the employee table and creates a table alias of emp_salary for the selection.
The (SELECT * FROM employee_order WHERE emp_id=4) AS emp_order portion selects all the columns where the emp_id is 4 from the employee_order table and creates a table alias of emp_order for the selection.
The RIGHT OUTER JOIN portion joins records in both tables, putting a NULL value in every column of the left table that lacks a matching row in the right table. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The SELECT emp_salary.emp_id, max_salary FROM portion selects only the emp_salary.emp_id and max_salary columns to produce the following output.
The fourth embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version:
At step 706, query processor 120 determines whether the outer join is represented by a right outer join. Responsive to a negative determination, processing proceeds through connector F to step 414 in
Referring to
At step 412, query processor 120 transforms the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation and results in a statement of:
To formulate a more general definition provided by the fourth embodiment, an outer join can be removed from an SQL statement that includes a first query and a second query, wherein the first query and second query are respectively the left side and the right side operands of a OUTER JOIN operation, wherein the OUTER JOIN operation is represented by a RIGHT OUTER JOIN, and the output quantified by the left side of the outer join does not match the output quantified by the right side of the outer join, if:
In a fifth embodiment of the invention, a filter predicate over multiple DISTINCT aggregation may be optimized. If the SQL statement has a filter predicate on the multiple distinct aggregation output, it is still possible to perform the OUTER JOIN elimination by evaluating the predicate in a later stage. The following query Q9 is an example of a query that may be optimized using the fifth embodiment:
Starting with the (SELECT emp_id, MAX (DISTINCT salary) AS max_salary FROM employee GROUP BY emp_id) AS emp_salary portion, this selects two columns from the employee table, groups them by emp_id and creates a table alias of emp_order for the selection.
The (SELECT * FROM employee_order) AS emp_order portion selects all the columns from the employee_order table and creates a table alias of emp_order for the selection.
The LEFT OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the right table that lacks a matching row in the left table. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id WHERE max_salary>2000 predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal and the rows for which max_salary is not greater than 2000 are not selected.
The SELECT emp_salary.emp_id, max_salary FROM portion selects only the emp_salary.emp_id and max_salary columns to produce the following output:
The fifth embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version:
At step 806, query processor 120 determines whether the partitioning columns (emp_id) of the GROUP BY operation are the same as the OUTER JOIN partitioning columns (emp_salary.emp_id and emp_order.emp_id)). Responsive to a negative determination, processing proceeds to step 414 in
At step 808, query processor 120 determines whether the columns (*, that is all) quantified by the right side of the OUTER JOIN include one or more of multiple distinct aggregation operations or multiple aggregation operations (salary). Responsive to a negative determination, processing proceeds to step 414 and the method ends. Responsive to a positive determination, processing proceeds to step 810.
At step 810, query processor 120 determines whether the filter predicate can be evaluated later. Responsive to a negative determination, processing proceeds to step 414 and the method ends. Responsive to a positive determination, processing proceeds to step 412.
At step 412, query processor 120 transforms the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation and results in a statement of:
To formulate a more general definition provided by the fifth embodiment, an outer join can be removed from an SQL statement that includes a first query and a second query, wherein the first query and second query are respectively the left side and the right side operands of a OUTER JOIN operation, wherein the OUTER JOIN operation is a LEFT OUTER JOIN, if:
In a sixth embodiment of the invention, a HAVING clause on the multiple DISTINCT aggregation operation may be optimized. If the SQL statement has a having clause on the multiple distinct aggregation output, it is still possible to perform the outer join elimination by evaluating the having clause in a later stage. The following query Q11 is an example of a query that may be optimized using the sixth embodiment:
Starting with the (SELECT emp_id, MIN (DISTINCT salary) AS min_salary, MAX(DISTINCT salary) AS max_salary, SUM(salary) AS sum_salary FROM employee GROUP BY emp_id HAVING SUM(salary)>1000) AS emp_salary portion, this selects four columns from the employee table, groups them by emp_id, selects only those having SUM(salary)>1000 and creates a table alias of emp_salary for the selection.
The (SELECT * FROM employee_order) AS emp_order portion selects all the columns from the employee_order table and creates a table alias of emp_order for the selection.
The LEFT OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the right table that lacks a matching row in the left table. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The SELECT emp_salary.emp_id, min_salary, max_salary, sum_salary FROM portion selects only the emp_salary.emp_id, min_salary, max_salary and sum_salary columns to produce the following output:
The sixth embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version:
At step 906, query processor 120 determines whether the outer join is represented by a left outer join. Responsive to a negative determination, processing proceeds to step 414 and the method ends. Responsive to a positive determination, processing proceeds to step 908. At step 908, query processor 120 determines whether the filter predicate and HAVING clause in the GROUP BY operation can be evaluated later. Responsive to a negative determination, processing proceeds to step 414 and the method ends. Responsive to a positive determination, processing proceeds to step 410.
At step 412, query processor 120 transforms the SQL statement into an optimized query SQL statement by removing the OUTER JOIN operation and results in a statement of:
To formulate a more general definition provided by the sixth embodiment, an outer join can be removed from an SQL statement that includes a first query and a second query, wherein the first query and second query are respectively the left side and the right side operands of a OUTER JOIN operation, wherein the OUTER JOIN operation is represented by a LEFT OUTER JOIN, and the SQL statement has a having clause on the multiple distinct aggregation output, if:
In a seventh embodiment of the invention, several forms of outer join elimination as described above in the previous embodiments are combined together to handle more complicated database statements, as for example:
Starting with the (SELECT emp_id, MIN (salary) AS min_salary, MAX (DISTINCT salary) AS max_salary FROM employee GROUP BY emp_id) AS emp_salary portion, this selects three columns from the employee table and groups them by emp_id and creates a table alias of emp_salary for the selection.
The (SELECT * FROM employee_order) AS emp_order portion selects all the columns from the employee_order table and creates a table alias of emp_order for the selection.
The FULL OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the table that lacks a matching row. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The (SELECT emp_id, order FROM employee_order WHERE emp_id=4) AS emp_order2 portion selects two columns where the emp_id is 4 from the employee_order table and creates a table alias of emp_order2 for the selection.
The RIGHT OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the left table that lacks a matching row in the right table. In this example, there are no columns in the table which lack a matching row.
The ON emp_salary.emp_id=emp_order2.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The (SELECT * FROM employee) AS emp portion selects all the columns from the employee table and creates a table alias of emp for the selection.
The LEFT OUTER JOIN portion joins records in both tables, putting a NULL Value in every column of the right table that lacks a matching row in the left table. In this example, there are no columns in the table which lack a matching row.
The ON emp_order2.emp_id=emp.emp_id predicate 312 portion applies a condition to the rows which are selected, meaning that the rows for which emp_id in each of the two tables are not equal are not selected. In this example there are no rows for which emp_id in each of the two tables are not equal and so all rows are selected.
The SELECT emp_salary.emp_id, min_salary, max_salary FROM portion selects only the emp_salary.emp_id, min_salary, max_salary columns to produce the following output:
The seventh embodiment of the invention optimizes the given query within a database compiler as follows:
This produces the following result, which can be seen as being the same as that produced by the non-optimized version:
Referring now to
Computer system 1012 is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system 1012 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.
Computer system 1012 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system. Generally, program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types. Computer system 1012 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed cloud computing environment, program modules may be located in both local and remote computer system storage media including memory storage devices.
As shown in
Bus 1018 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Computer system 1012 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer system 1012, and it includes both volatile and non-volatile media, removable and non-removable media.
System memory 1028 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 1030 and/or cache memory 1032. Computer system 1012 may further include other removable/non-removable, volatile/non-volatile computer system storage media. By way of example only, storage system 1034 can be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a “hard drive”). Although not shown, a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a “floppy disk”), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media can be provided. In such instances, each can be connected to bus 1018 by one or more data media interfaces. As will be further depicted and described below, memory 1028 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
Program/utility 1040, having a set (at least one) of program modules 1042, may be stored in memory 1028 by way of example, and not limitation, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating system, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment. Program modules 1042 generally carry out the functions and/or methodologies of embodiments of the invention as described herein.
Computer system 1012 may also communicate with one or more external devices 1014 such as a keyboard, a pointing device, a display 1024, etc.; one or more devices that enable a user to interact with computer system 1012; and/or any devices (e.g., network card, modem, etc.) that enable computer system 1012 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 1022. Still yet, computer system 1012 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 1020. As depicted, network adapter 1020 communicates with the other components of computer system 1012 via bus 1018. It should be understood that although not shown, other hardware and/or software components could be used in conjunction with computer system 1012. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.
The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, column-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5963933 | Cheng | Oct 1999 | A |
| 7546311 | Nica | Jun 2009 | B2 |
| 8352461 | Ahmed | Jan 2013 | B2 |
| 8396860 | Ramesh | Mar 2013 | B1 |
| 8600994 | Xu | Dec 2013 | B1 |
| 8868545 | Xu | Oct 2014 | B2 |
| 20090119247 | Bellamkonda | May 2009 | A1 |
| 20090292669 | Ahmed | Nov 2009 | A1 |
| 20130173589 | Xu | Jul 2013 | A1 |
| 20140101130 | Kang et al. | Apr 2014 | A1 |
| 20160275078 | Attaluri | Sep 2016 | A1 |
| Entry |
|---|
| Pedro et al., “Outer Join Optimizations in Database Management Systems”, U.S. Appl. No. 15/177,392, filed Jun. 9, 2016, 63 pages. |
| IBM, Appendix P, List of IBM Patents or Patent Applications Treated as Related, dated Jun. 9, 2016, 2 pages. |
| Boag et al., “XQuery 1.0: An XML Query Language (Second Edition)”, W3C®, W3C Recommendation Dec. 14, 2010 (Link errors corrected Jan. 3, 2011), pp. 1-106, Copyright © 2010 W3C®. |
| Codd, E. F., “Extending the Database Relational Model to Capture More Meaning”, IBM Research Laboratory, ACM Transactions on Database Systems, vol. 4, No. 4, Dec. 1979, pp. 397-434, doi 10.1145/320107.329109, © 1979 ACM 0362-5915/79/1200-0397. |
| Dayal et al., “View Definition and Generalization for Database Integration in a Multidatabase System”, IEEE Transactions on Software Engineering, vol. SE-10, No. 6, Nov. 1984, pp. 628-645, © 1984 IEEE. |
| Galindo-Legaria, Cesar A., “Algebraic Optimization of Outerjoin Queries,” a thesis presented to the Division of Applied Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Computer Science, Harvard University, Cambridge, Massachusetts, Jun. 1992, pp. 1-122. |
| Galindo-Legaria et al., “How to Extend a Conventional Optimizer to Handle One- and Two-Sided Outerjoin”, pp. 402-409, © 1992 IEEE. |
| Galindo-Legaria et al., “Outerjoin Simplification and Reordering for Query Optimization”, ACM Transactions on Database Systems, vol. 22, No. 1, Mar. 1997, pp. 43-74, © 1997 ACM. |
| Ghazal et al., “Outer Join Elimination in the Teradata RDBMS”, NCR Corporation, Teradata Division, 100 N. Sepulveda Blvd., El Segundo, CA, 90245, DEXA 2004, LNCS 3180, pp. 730-740, 2004, © Springer-Verlag Berlin Heidelberg 2004. |
| Hernandez et al., “Clio: A Semi-Automatic Tool for Schema Mapping”, ACM SIGMOD 2001, May 21-24, Santa Barbara, California, USA, Copyright 2001 ACM 1-5813-332-4/01/05, 1 page. |
| “Elimination of unnecessary inner and outer joins”, SQL Anywhere 12.0.0, printed on Jun. 8, 2015, 1 page, Copyright © 2010, iAnywhere Solutions, Inc.—SQL Anywhere 12.0.0. |
| “Method and System for Full Outer Join Elimination in the Presence of Multiple Distinct Aggregation”, An IP.com Prior Art Database Technical Disclosure, Authors et. al.: Disclosed Anonymously, IP.com No. 000212340, IP.com Electronic Publication: Nov. 7, 2011, pp. 1-6, <IP.com at: http://null/IPCOM/000212340>. |
| Number | Date | Country | |
|---|---|---|---|
| 20170031989 A1 | Feb 2017 | US |
