公开(公告)号：US20170139987A1

公开(公告)日：2017-05-18

申请号：US14945300

申请日：2015-11-18

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Tobias Mindnich ,  Johannes Merx ,  Alena Bakulina

IPC: G06F17/30

CPC classification number: G06F17/30427

Abstract: A calculation engine is described that executes calculation scenarios comprising a plurality of calculation nodes that each specify operations to be performed to execute the query. One of the nodes can be a semantic node that is used to modify a higher-level programming language query that stacks the calculation scenario on top of another semantic node based calculation scenario for operations that call for processing of non-processable key figures. Non-processable key figures being key figures that produce incorrect semantics when processed by higher-level calculation scenarios. Related apparatus, systems, methods, and articles are also described.

公开(公告)号：US20190311059A1

公开(公告)日：2019-10-10

申请号：US15945605

申请日：2018-04-04

Applicant: SAP SE

Inventor： Alena Bakulina ,  Johannes Merx ,  Julian Schwing ,  Christoph Weyerhaeuser

IPC: G06F17/30

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently filters and joins data for processing. The calculation engine enhances the performance of the join operations by allowing join inputs to be pre-filtered more effectively. Such join operations can allow for faster processing times, and a reduction in the amount of data to be joined, resulting in more efficient processing.

公开(公告)号：US20170147637A1

公开(公告)日：2017-05-25

申请号：US14946658

申请日：2015-11-19

Applicant: SAP SE

Inventor： Tobias Mindnich ,  Julian Schwing ,  Christoph Weyerhaeuser ,  Isil Pekel ,  Johannes Merx ,  Alena Bakulina

IPC: G06F17/30

CPC classification number: G06F17/30448

Abstract: Methods and apparatus, including computer program products, are provided for union node pruning. In one aspect, there is provided a method, which may include receiving, by a calculation engine, a query; processing a calculation scenario including a union node; accessing a pruning table associated with the union node, wherein the pruning table includes semantic information describing the first input from the first data source node and the second input from the second data source node; determining whether the first data source node and the second data source node can be pruned by at least comparing the semantic information to at least one filter of the query; and pruning, based on a result of the determining, at least one the first data source node or the second data source node. Related apparatus, systems, methods, and articles are also described.

公开(公告)号：US10949431B2

公开(公告)日：2021-03-16

申请号：US15946028

申请日：2018-04-05

Applicant: SAP SE

Inventor： Alena Bakulina ,  Christoph Weyerhaeuser

IPC: G06F16/2457 ,  G06F7/08 ,  G06F16/22

Abstract: Described herein is a top operator of a calculation scenario of a calculation engine that can process and rank data according to certain logical criterion requested in a query. Based on the ranked data, the top operator can provide the data results in response to the query. The top operator can provide additional useful data in the data results when certain conditions are met. The top operator can provide the data results in a useful and efficient manner.

公开(公告)号：US20190311043A1

公开(公告)日：2019-10-10

申请号：US15946028

申请日：2018-04-05

Applicant: SAP SE

Inventor： Alena Bakulina ,  Christoph Weyerhaeuser

IPC: G06F17/30 ,  G06F7/08

Abstract: Described herein is a top operator of a calculation scenario of a calculation engine that can process and rank data according to certain logical criterion requested in a query. Based on the ranked data, the top operator can provide the data results in response to the query. The top operator can provide additional useful data in the data results when certain conditions are met. The top operator can provide the data results in a useful and efficient manner.

公开(公告)号：US10255316B2

公开(公告)日：2019-04-09

申请号：US14945339

申请日：2015-11-18

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Alena Bakulina ,  Tobias Mindnich ,  Johannes Merx ,  Julian Schwing

IPC: G06F17/30

Abstract: A database server receives a request to perform a primary query on a table of a database. A first table query can be generated and can include a starting row identifier, ROW A, and a number of rows, n, for generating a data chunk from the table of the database. Multiple table queries can be performed each having a different starting row identifier and each defining the number of rows forming a data chunk. The primary query can be extended with the first table query in preparation for performing the primary query on the first data chunk.

公开(公告)号：US11188540B2

公开(公告)日：2021-11-30

申请号：US15945605

申请日：2018-04-04

Applicant: SAP SE

Inventor： Alena Bakulina ,  Johannes Merx ,  Julian Schwing ,  Christoph Weyerhaeuser

IPC: G06F16/2455 ,  G06F16/22

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently filters and joins data for processing. The calculation engine enhances the performance of the join operations by allowing join inputs to be pre-filtered more effectively. Such join operations can allow for faster processing times, and a reduction in the amount of data to be joined, resulting in more efficient processing.

公开(公告)号：US10324927B2

公开(公告)日：2019-06-18

申请号：US14946658

申请日：2015-11-19

Applicant: SAP SE

Inventor： Tobias Mindnich ,  Julian Schwing ,  Christoph Weyerhaeuser ,  Isil Pekel ,  Johannes Merx ,  Alena Bakulina

IPC: G06F16/2453

Abstract: Methods and apparatus, including computer program products, are provided for union node pruning. In one aspect, there is provided a method, which may include receiving, by a calculation engine, a query; processing a calculation scenario including a union node; accessing a pruning table associated with the union node, wherein the pruning table includes semantic information describing the first input from the first data source node and the second input from the second data source node; determining whether the first data source node and the second data source node can be pruned by at least comparing the semantic information to at least one filter of the query; and pruning, based on a result of the determining, at least one the first data source node or the second data source node. Related apparatus, systems, methods, and articles are also described.

公开(公告)号：US10140335B2

公开(公告)日：2018-11-27

申请号：US14945300

申请日：2015-11-18

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Tobias Mindnich ,  Johannes Merx ,  Alena Bakulina

IPC: G06F17/30

Abstract: A calculation engine is described that executes calculation scenarios comprising a plurality of calculation nodes that each specify operations to be performed to execute the query. One of the nodes can be a semantic node that is used to modify a higher-level programming language query that stacks the calculation scenario on top of another semantic node based calculation scenario for operations that call for processing of non-processable key figures. Non-processable key figures being key figures that produce incorrect semantics when processed by higher-level calculation scenarios. Related apparatus, systems, methods, and articles are also described.

公开(公告)号：US20170139982A1

公开(公告)日：2017-05-18

申请号：US14945339

申请日：2015-11-18

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Alena Bakulina ,  Tobias Mindnich ,  Johannes Merx ,  Julian Schwing

IPC: G06F17/30

CPC classification number: G06F17/30395 ,  G06F17/30557

Abstract: A database server receives a request to perform a primary query on a table of a database. A first table query can be generated and can include a starting row identifier, ROW A, and a number of rows, n, for generating a data chunk from the table of the database. Multiple table queries can be performed each having a different starting row identifier and each defining the number of rows forming a data chunk. The primary query can be extended with the first table query in preparation for performing the primary query on the first data chunk.