Processing window partitioning and ordering for on-line analytical processing (OLAP) functions

• US 10,671,610 B2
• Filed: 08/10/2018
• Issued: 06/02/2020
• Est. Priority Date: 08/28/2015
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Ackerman, William B., Lin, Eileen T., Meyers, David L., Misra, Shivin S., Zabka, Michael R.
• Primary Examiner(s): Tran, Anhtai V
• Application Number:
  US16/100,675
• Publication Number:
  US 20180349442A1
• Time in Patent Office: 662 Days
• Field of Search: None
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/24554 Unary operations; Data partitioning operations
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP

Abstract

Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Claims

1. A computer-implemented method, comprising:

in response to receiving a first query,

obtaining a set of prior compares, wherein each prior compare of the set of prior compares has attributes;

in response to determining that there are attributes shared by multiple prior compares in the set of prior compares, finding an intersection of attributes;

selecting a prior compare from the set of prior compares that has not been examined;

in response to determining that the intersection of attributes is part of the selected prior compare,

removing the selected prior compare from the set of prior compares; and

inserting a new prior compare into the set of prior compares with the attributes of the intersection of attributes; and

in response to determining that the selected prior compare is any one of a new intersection and part of the set of prior compares initially obtained, adding the selected prior compare to prior compare building blocks; and

in response to receiving a second query, re-using the prior compare building blocks.

2. The computer-implemented method of claim 1, comprising:

in response to determining that there are no attributes shared by multiple prior compares in the set of prior compares,

adding the set of prior compares to the prior compare building blocks;

sorting the prior compare building blocks by a number of attributes in each of the prior compare building blocks; and

returning the sorted prior compare building blocks.

3. The computer-implemented method of claim 1, comprising:

determining that the intersection of attributes is not part of the selected prior compare; and

in response to determining that there is another prior compare in the set of prior compares to be examined, selecting another prior compare from the set of prior compares that has not been examined.

4. The computer-implemented method of claim 1, comprising:

constructing new prior compare building blocks from the prior compare building blocks using a vectorized OR operation.

5. The computer-implemented method of claim 1, wherein each prior compare of the set of prior compares corresponds to one of window partitioning and window ordering.

6. A computer program product, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by at least one processor to perform:

in response to receiving a first query,

obtaining a set of prior compares, wherein each prior compare of the set of prior compares has attributes;

in response to determining that there are attributes shared by multiple prior compares in the set of prior compares, finding an intersection of attributes;

selecting a prior compare from the set of prior compares that has not been examined;

in response to determining that the intersection of attributes is part of the selected prior compare,

removing the selected prior compare from the set of prior compares; and

inserting a new prior compare into the set of prior compares with the attributes of the intersection of attributes; and

in response to determining that the selected prior compare is any one of a new intersection and part of the set of prior compares initially obtained, adding the selected prior compare to prior compare building blocks; and

in response to receiving a second query, re-using the prior compare building blocks.

7. The computer program product of claim 6, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by at least one processor to perform:

in response to determining that there are no attributes shared by multiple prior compares,

adding the set of prior compares to the prior compare building blocks;

sorting the prior compare building blocks by a number of attributes in each of the prior compare building blocks; and

returning the sorted prior compare building blocks.

8. The computer program product of claim 6, wherein the program code is executable by the at least one processor to perform:

determining that the intersection of attributes is not part of the selected prior compare; and

in response to determining that there is another prior compare in the set of prior compares to be examined, selecting another prior compare from the set of prior compares that has not been examined.

9. The computer program product of claim 6, wherein the program code is executable by the at least one processor to perform:

constructing new prior compare building blocks from the prior compare building blocks using a vectorized OR operation.

10. The computer program product of claim 6, wherein each prior compare of the set of prior compares corresponds to one of window partitioning and window ordering.

11. A computer system, comprising:

one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices; and

program instructions, stored on at least one of the one or more computer-readable, tangible storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to perform operations comprising;

in response to receiving a first query,

obtaining a set of prior compares, wherein each prior compare of the set of prior compares has attributes;

in response to determining that there are attributes shared by multiple prior compares in the set of prior compares, finding an intersection of attributes;

selecting a prior compare from the set of prior compares that has not been examined;

in response to determining that the intersection of attributes is part of the selected prior compare,

removing the selected prior compare from the set of prior compares; and

inserting a new prior compare into the set of prior compares with the attributes of the intersection of attributes; and

in response to determining that the selected prior compare is any one of a new intersection and part of the set of prior compares initially obtained, adding the selected prior compare to prior compare building blocks; and

in response to receiving a second query, re-using the prior compare building blocks.

12. The computer system of claim 11, wherein the operations further comprise:

in response to determining that there are no attributes shared by multiple prior compares,

adding the set of prior compares to the prior compare building blocks;

sorting the prior compare building blocks by a number of attributes in each of the prior compare building blocks; and

returning the sorted prior compare building blocks.

13. The computer system of claim 11, wherein the operations further comprise:

determining that the intersection of attributes is not part of the selected prior compare; and

in response to determining that there is another prior compare in the set of prior compares to be examined, selecting another prior compare from the set of prior compares that has not been examined.

14. The computer system of claim 11, wherein the operations further comprise:

constructing new prior compare building blocks from the prior compare building blocks using a vectorized OR operation.

15. The computer system of claim 11, wherein each prior compare of the set of prior compares corresponds to one of window partitioning and window ordering.