Sideways information passing

Patent metadata

Field	Value
Publication number	US-10380269-B2
Application number	US-201113155232-A
Country	US
Kind code	B2
Filing date	Jun 7, 2011
Priority date	Jun 7, 2011
Publication date	Aug 13, 2019
Grant date	Aug 13, 2019

Abstract

Methods, systems and program products for query optimization using sideways information passing. In one implementation, a join clause in a query is identified that specifies an outer table of tuples to be joined with an inner table, the outer table having one or more attributes, and each of the attributes of the outer table having values stored in an attribute file that is distinct from attribute files in which the values of other attributes are stored. A plan for the query is created which, when executed, causes selection of a subset of tuples of the outer table to serve as input to the join clause in place of the outer table based on one or more predicates applied to the inner table.

First claim

What is claimed is:

1. A method comprising:
identifying, by a processor, a join clause in a query, the join clause specifying an outer table of tuples to be joined with an inner table, the join clause including an equality predicate equating a first attribute of the outer table to a second attribute of the inner table;
in response to identifying the join clause in the query, the processor creating a hash table for second attribute values of inner table tuples using the first attribute of the outer table from the equality predicate that satisfies one or more predicates applied to the inner table;
filtering, by the processor, each tuple of the outer table using the hash table to create a filtered subset of tuples of the outer table, wherein the filtering includes:
storing values for the first attribute of the outer table in a dedicated attribute file as a sequence of blocks and according to a sort order, the dedicated attribute file having an index;
utilizing the index and the sort order to read values from a plurality of non-contiguous portions of the dedicated attribute file that are necessary for the filtering, without reading other portions of the attribute file that are not necessary; and
utilizing the values from the plurality of non-contiguous portions of the dedicated attribute file to create the filtered subset of tuples of the outer table; and

performing, by the processor, a join operation to join the filtered subset of the outer table to the inner table, the join operation corresponding to the join clause in the query.

2. The method of claim 1 , wherein each of the attributes of the outer table is a run-length encoded attribute.

3. The method of claim 1 , the inner table having a second set of attributes, each of the second set of attributes of the inner table having attribute values stored in an attribute file that is distinct from attribute files in which the values of other attributes of the second set are stored.

4. The method of claim 3 , further comprising:
determining a maximum value of the second set of attributes of the inner table; and
selecting one or more tuples of the outer table having attribute values that are less than the determined maximum value and that are in the hash table.

5. The method of claim 1 , further comprising generating a query plan to execute the query, the query plan including a creation of the hash table.

6. The method of claim 1 , wherein the filtering is configured to adaptively stop if a threshold condition is met.

7. A computing device comprising:
a processor;
a non-transitory storage medium storing instructions executable by the processor to:
identify a join clause in a query, the join clause specifying an outer table of tuples to be joined with an inner table, the join clause including an equality predicate equating a first attribute of the outer table to a second attribute of the inner table;
in response to identifying the join clause in the query, create a hash table for second attribute values of inner table tuples using the first attribute of the outer table from the equality predicate that satisfies one or more predicates applied to the inner table;
filter each tuple of the outer table using the hash table to create a filtered subset of tuples of the outer table, wherein to filter each tuple, the instructions are further executable to:
store values for the first attribute of the outer table in a dedicated attribute file as a sequence of blocks and according to a sort order, the dedicated attribute file having an index;
utilize the index and the sort order to read values from a plurality of non-contiguous portions of the dedicated attribute file that are necessary for the filtering, without reading other portions of the attribute file that are not necessary; and
utilize the values from the plurality of non-contiguous portions of the dedicated attribute file to create the filtered subset of tuples of the outer table; and

perform a join operation to join the filtered subset of the outer table to the inner table, the join operation corresponding to the join clause in the query.

8. The computing device of claim 7 , wherein each of the attributes of the outer table is a run-length encoded attribute.

9. The computing device of claim 7 , the inner table having a second set of attributes, each of the second set of attributes of the inner table having attribute values stored in an attribute file that is distinct from attribute files in which the values of other attributes of the second set are stored.

10. The computing device of claim 9 , the instructions further executable to:
determine a maximum value of the second set of attributes of the inner table; and
select one or more tuples of the outer table having attribute values that are less than the determined maximum value and that are in the hash table.

11. The computing device of claim 7 , the instructions further executable to:
generate a query plan to execute the query, the query plan including a creation of the hash table.

12. The method of claim 7 , wherein the filtering is configured to adaptively stop if a threshold condition is met.

13. An article comprising a non-transitory storage medium storing instructions that upon execution cause a processor to:
identify a join clause in a query, the join clause specifying an outer table of tuples to be joined with an inner table, the join clause including an equality predicate equating a first attribute of the outer table to a second attribute of the inner table;
in response to identifying the join clause in the query, create a hash table for second attribute values of inner table tuples using the first attribute of the outer table from the equality predicate that satisfies one or more predicates applied to the inner table;
filter each tuple of the outer table using the hash table to create a filtered subset of tuples of the outer table, wherein to filter each tuple, the instructions are further executable to:
store values for the first attribute of the outer table in a dedicated attribute file as a sequence of blocks and according to a sort order, the dedicated attribute file having an index;
utilize the index and the sort order to read values from a plurality of non-contiguous portions of the dedicated attribute file that are necessary for the filtering, without reading other portions of the attribute file that are not necessary; and
utilize the values from the plurality of non-contiguous portions of the dedicated attribute file to create the filtered subset of tuples of the outer table; and

perform a join operation to join the filtered subset of the outer table to the inner table, the join operation corresponding to the join clause in the query.

14. The article of claim 13 , wherein each of the attributes of the outer table is a run-length encoded attribute.

15. The article of claim 13 , the inner table having a second set of attributes, each of the second set of attributes of the inner table having attribute values stored in an attribute file that is distinct from attribute files in which the values of other attributes of the second set are stored.

16. The article of claim 15 , the instructions further executable to:
determine a maximum value of the second set of attributes of the inner table; and
select one or more tuples of the outer table having attribute values that are less than the determined maximum value and that are in the hash table.

17. The article of claim 13 , the instructions further executable to:
generate a query plan to execute the query, the query plan including a creation

Assignees

• Bear Chuck
• Shrinivas Lakshmikant
• Lamb Andrew
• Entit Software Llc

Inventors

• Bear Chuck
• Shrinivas Lakshmikant
• Lamb Andrew

Classifications

• G06F16/24542

  Plan optimisation · CPC title

• G06F16/284 Primary

  Relational databases · CPC title

• G06F17/30595

  Physics · mapped topic

• G06F17/30463 Primary

  Physics · mapped topic