公开(公告)号：US10521431B2

公开(公告)日：2019-12-31

申请号：US15150368

申请日：2016-05-09

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Johannes Merx

IPC: G06F16/2455

Abstract: A calculation engine of a database management system is described. In an exemplary implementation, the calculation engine receives a calculation scenario. The calculation scenario includes one or more relational operations and one or more non-relational operations of a multiprovider, the multiprovider utilizing a plurality of database partitions. The calculation engine processes the one or more non-relational operations via the multiprovider. After processing the one or more non-relational operations, the calculation engine converts the one or more relational operations. This converting comprises filtering first data from the plurality of partitions to form second data and forming third data by performing a union operation on the second data. Thereafter, the third data is filtered to form fourth data. Related systems, methods, and articles of manufacture 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.

公开(公告)号：US20190311058A1

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

申请号：US15945022

申请日：2018-04-04

Applicant: SAP SE

Inventor： Davide Corradi ,  Johannes Merx ,  Julian Schwing ,  Christoph Weyerhaeuser

IPC: G06F17/30

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.

公开(公告)号：US20190018876A1

公开(公告)日：2019-01-17

申请号：US15650800

申请日：2017-07-14

Applicant: SAP SE

Inventor： Julian Schwing ,  Johannes Merx ,  Christoph Weyerhaeuser

IPC: G06F17/30

Abstract: A method may include executing a calculation scenario at a database. The calculation scenario may include a parent multiprovider aggregating data from a child multiprovider. The calculation scenario may be executed by mapping a first count keyfigure of the child multiprovider to a first sum keyfigure of the parent multiprovider if the child multiprovider aggregates data from part providers but not from multiproviders. A second sum keyfigure of the child multiprovider may be mapped to the first sum keyfigure of the parent multiprovider if the child multiprovider aggregates data from multiproviders but not from any part providers. The first count keyfigure of the child multiprovider may be mapped to a second count keyfigure of the parent multiprovider and the second sum keyfigure of the child multiprovider may be mapped to the first sum keyfigure of the parent multiprovider if the child multiprovider aggregates data from part providers and multiproviders.

公开(公告)号：US10169410B2

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

申请号：US14945360

申请日：2015-11-18

Applicant: SAP SE

Inventor： Johannes Merx ,  Tobias Mindnich ,  Christoph Weyerhaeuser

IPC: G06F17/30

Abstract: A stacked calculation view, defining a calculation scenario, having calculation views associated with high-level programming logic which can include complex analytical privileges. Resolving, using a high-level programming logic layer, a calculation view having associated high-level programming logic with the next calculation view in the stack to generate a sub-query. Converting the sub-query into a format readable by a database system and separating the part of the sub-query provided by the high-level programming logic from the sub-query to form a high-level programming logic filter in the database system format. Merge the high-level programming logic filter into the calculation scenario to provide a calculation scenario including high-level programming logic information in the database system format.

公开(公告)号：US20170322952A1

公开(公告)日：2017-11-09

申请号：US15150371

申请日：2016-05-09

Applicant: SAP SE

Inventor： Julian Schwing ,  Johannes Merx ,  Christoph Weyerhaeuser

IPC: G06F17/30

CPC classification number: G06F16/2453

Abstract: A calculation engine of a database management system is described. In some implementations, the calculation engine receives a calculation scenario including a plurality of join operations defining an intersection between at least two nodes. The calculation engine optimizes a first join which is of a certain cardinality, and for which no attributes are requested, other than a join attribute. The optimization includes determining whether a static filter is present for a first node or a second node of the first join, and pruning the first node and/or the second node from the hierarchical join when the attribute is not requested from the first node or the second node and/or when the static filter is not present for the first node or the second node. Related systems, methods, and articles of manufacture are also described.

公开(公告)号：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.

公开(公告)号：US20170024457A1

公开(公告)日：2017-01-26

申请号：US15286445

申请日：2016-10-05

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Tobias Mindnich ,  Daniel Baeumges ,  Gerrit Simon Kazmaier

IPC: G06F17/30

CPC classification number: G06F16/285 ,  G06F16/221 ,  G06F16/24578 ,  G06F16/29

Abstract: A range k-nearest neighbor search query of a database is processed by first defining an inner rectangle bounded within a circle around a center point specified by the range k-nearest neighbor search query. Thereafter, a distance to the center point is calculated for each point within the inner rectangle. Query results are returned if k or more points are within the inner rectangle. Otherwise, at least one additional query is executed. Related apparatus, systems, techniques and articles are also described.

Abstract translation: 通过首先定义围绕由范围k-最近邻搜索查询指定的中心点的圆圈内界限的内部矩形来处理数据库的范围k-最近邻搜索查询。 此后，针对内部矩形内的每个点计算到中心点的距离。 如果k个或更多个点在内部矩形内，则返回查询结果。 否则，至少执行一个附加查询。 还描述了相关设备，系统，技术和物品。

公开(公告)号：US09128969B2

公开(公告)日：2015-09-08

申请号：US14248099

申请日：2014-04-08

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Tobias Mindnich ,  Daniel Baeumges ,  Gerrit Simon Kazmaier

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30321 ,  G06F17/30241 ,  G06F17/30315 ,  G06F17/30445 ,  G06F17/30486

Abstract: A database query of point data among two or more axes of a database is received. The database stores point data in distinct integer vectors with a shared dictionary. Thereafter, the dictionary is scanned to determine boundaries for each axis specified by the query. In response, results characterizing data responsive to the query within the determined boundaries for each axis are returned. Related apparatus, systems, techniques and articles are also described.

Abstract translation: 接收到数据库的两个或多个轴之间的点数据的数据库查询。 数据库使用共享字典将点数据存储在不同的整数向量中。 此后，扫描字典以确定查询指定的每个轴的边界。 作为响应，返回表征响应于针对每个轴的确定的边界内的查询的数据的结果。 还描述了相关设备，系统，技术和物品。

公开(公告)号：US11113285B2

公开(公告)日：2021-09-07

申请号：US15945022

申请日：2018-04-04

Applicant: SAP SE

Inventor： Davide Corradi ,  Johannes Merx ,  Julian Schwing ,  Christoph Weyerhaeuser

IPC: G06F17/30 ,  G06F16/2455 ,  G06F16/22 ,  G06F16/2453

Abstract: Described herein includes a calculation scenario of a calculation engine that efficiently partitions data for processing at separate hosts, including in parallel, and unions intermediate results from such separate processing when required for further processing. Such parallel processing of partitions can allow for faster processing times, and such unioning of data only when required for further processing can limit the transferring of data that results in slower processing.