SPLIT PROCESSING PATHS FOR A DATABASE CALCULATION ENGINE

• US 20130166589A1
• Filed: 12/23/2011
• Published: 06/27/2013
• Est. Priority Date: 12/23/2011
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Baeumges, Daniel, Bensberg, Christian, Fricke, Lars
• Granted Patent: US 8,868,594 B2
• Time in Patent Office: Days
• US Class Current: 707/769
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/24532 of parallel queries
• CPC Class Codes: G06F 16/24535 of sub-queries or views
• CPC Class Codes: G06F 16/24542 Plan optimisation
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/24554 Unary operations; Data partitioning operations
• CPC Class Codes: G06F 16/2457 with adaptation to user needs

Abstract

A dynamic split node defined within a calculation model can receive data being operated on by a calculation plan generated based on the calculation model. A partition specification can be applied to one or more reference columns in a table containing at least some of the received data. The applying can cause the table to be split such that a plurality of records in the table are partitioned according to the partition specification. A separate processing path can be set for each partition, and execution of the calculation plan can continue using the separate processing paths, each of which can be assigned to a processing node of a plurality of available processing nodes.

Claims

1. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:

receiving, at a dynamic split node defined within a calculation model, data being operated on by a calculation plan generated based on the calculation model;

applying a partition specification to one or more reference columns in a table containing at least some of the received data, the applying causing the table to be split such that a plurality of records in the table are partitioned according to the partition specification;

setting a separate processing path for each partition; and

continuing execution of the calculation plan using the separate processing paths, each of the separate processing paths being assigned to a processing node of a plurality of available processing nodes.

2. A computer program product as in claim 1, wherein the partition specification comprises a split of the table according to a number of distinct values in the one or more reference columns.

3. A computer program product as in claim 1, wherein the calculation plan is generated in response to a query.

4. A computer program product as in claim 3, wherein the operations further comprise initiating the query, the initiating further comprising:

receiving, by a recipient node of the plurality of processing nodes each comprising at least one data partition of the plurality of data partitions, a first data request, the first data request being received directly from a requesting machine without being handled by a master node,

identifying, by the recipient node, a target node of the plurality of processing nodes to handle the data request, the determining comprising the recipient node applying partitioning information to determine one partition of the plurality of partitions to which the data request should be directed and mapping information associating each data partition of the plurality of data partitions with an assigned node of the plurality of processing nodes; and

redirecting, by the recipient node, the data request to the target node so that the target node can act on the one partition in response to the data request.

5. A computer program product as in claim 4, wherein the operations further comprise accessing the partitioning information and the mapping information from at least one of a local storage accessible to the recipient node and a metadata repository accessible to each of the plurality of processing nodes.

6. A system comprising:

at least one programmable processor; and

a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform operations comprising;

receiving, at a dynamic split node defined within a calculation model, data being operated on by a calculation plan generated based on the calculation model;

applying a partition specification to one or more reference columns in a table containing at least some of the received data, the applying causing the table to be split such that a plurality of records in the table are partitioned according to the partition specification;

setting a separate processing path for each partition; and

continuing execution of the calculation plan using the separate processing paths, each of the separate processing paths being assigned to a processing node of a plurality of available processing nodes.

7. A system as in claim 6, wherein the partition specification comprises a split of the table according to a number of distinct values in the one or more reference columns.

8. A system as in claim 6, wherein the calculation plan is generated in response to a query.

9. A system as in claim 8, wherein the operations further comprise initiating the query, the initiating further comprising:

receiving, by a recipient node of the plurality of processing nodes each comprising at least one data partition of the plurality of data partitions, a first data request, the first data request being received directly from a requesting machine without being handled by a master node,

identifying, by the recipient node, a target node of the plurality of processing nodes to handle the data request, the determining comprising the recipient node applying partitioning information to determine one partition of the plurality of partitions to which the data request should be directed and mapping information associating each data partition of the plurality of data partitions with an assigned node of the plurality of processing nodes; and

redirecting, by the recipient node, the data request to the target node so that the target node can act on the one partition in response to the data request.

10. A system as in claim 9, wherein the operations further comprise accessing the partitioning information and the mapping information from at least one of a local storage accessible to the recipient node and a metadata repository accessible to each of the plurality of processing nodes.

11. A computer-implemented method comprising:

receiving, at a dynamic split node defined within a calculation model, data being operated on by a calculation plan generated based on the calculation model;

applying a partition specification to one or more reference columns in a table containing at least some of the received data, the applying causing the table to be split such that a plurality of records in the table are partitioned according to the partition specification;

setting a separate processing path for each partition; and

continuing execution of the calculation plan using the separate processing paths, each of the separate processing paths being assigned to a processing node of a plurality of available processing nodes.

12. A computer-implemented method as in claim 11, wherein the partition specification comprises a split of the table according to a number of distinct values in the one or more reference columns.

13. A computer-implemented method as in claim 11, wherein the calculation plan is generated in response to a query.

14. A computer-implemented method as in claim 13, wherein the operations further comprise initiating the query, the initiating further comprising:

receiving, by a recipient node of the plurality of processing nodes each comprising at least one data partition of the plurality of data partitions, a first data request, the first data request being received directly from a requesting machine without being handled by a master node,

identifying, by the recipient node, a target node of the plurality of processing nodes to handle the data request, the determining comprising the recipient node applying partitioning information to determine one partition of the plurality of partitions to which the data request should be directed and mapping information associating each data partition of the plurality of data partitions with an assigned node of the plurality of processing nodes; and

redirecting, by the recipient node, the data request to the target node so that the target node can act on the one partition in response to the data request.

15. A computer-implemented method as in claim 14, further comprising accessing the partitioning information and the mapping information from at least one of a local storage accessible to the recipient node and a metadata repository accessible to each of the plurality of processing nodes.

16. A computer-implemented method as in claim 11, wherein at least one of the receiving, the applying, the setting, and the continuing is performed by at least one programmable processor.