公开(公告)号：US10114859B2

公开(公告)日：2018-10-30

申请号：US14946664

申请日：2015-11-19

Applicant: SAP SE

Inventor： Romans Kasperovics ,  Tobias Mindnich ,  Cornelia Kinder ,  Christoph Weyerhaeuser ,  Thomas Fischer

IPC: G06F17/30

Abstract: Based on received input, a vertex table of the database layer and a vertex key column in the vertex table can be identified. The vertex key column defines vertices of a graph representation. Also based on the received input, an edge table of the database layer, an edge key column in the edge table, a source column in the edge table, and a target column in the edge table can be identified. The source column and target column define relationships between vertices of the plurality of vertices. Within a graph workspace object, graph relationships linking the vertices defined by the vertex key column via edges defined by the source column and target column in the edge table can be assigned, and the graph workspace can be generated in a higher level programming layer based on the graph workspace object.

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

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

公开(公告)号：US09842137B2

公开(公告)日：2017-12-12

申请号：US14590769

申请日：2015-01-06

Applicant: SAP SE

Inventor： Franz Faerber ,  Daniel Baeumges ,  Tobias Mindnich ,  Christoph Weyerhaeuser

IPC: G06F17/30

CPC classification number: G06F17/30463 ,  G06F17/30315 ,  G06F17/30404 ,  G06F17/30433 ,  G06F17/30471

Abstract: The present invention includes a database with a semantic layer for performing standard SQL and complex operations custom to one or more application. In one embodiment the present invention includes receiving a data request from an application in a database, the data request specifying standard SQL operations and custom application operations to be performed for said application. The data request is processed in a semantic layer of the database. The semantic layer processes the standard SQL operations and the custom application operations and generates a logical execution plan comprising the standard SQL operations and the custom application operations. The logical execution plan is converted into a physical execution plan, which is executed by the database to generate a data result. The data result may be sent back to the application.

公开(公告)号：US09672250B2

公开(公告)日：2017-06-06

申请号：US15094708

申请日：2016-04-08

Applicant: SAP SE

Inventor： Christoph Weyerhaeuser ,  Daniel Baeumges ,  Tobias Mindnich ,  Thomas Legler

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30471 ,  G06F17/30463 ,  G06F17/30466 ,  G06F17/30867

Abstract: A select query or a data referencing a calculation scenario is received by a database server from a remote application server. The specified calculation scenario is one of a plurality of calculation scenarios and it defines a data flow model that includes one or more calculation nodes. Each calculation node defines one or more operations to execute on the database server. Thereafter, the database server instantiates the specified calculation scenario and executes the operations defined by the calculation nodes of the instantiated calculation scenario to result in a responsive data set. This data set is then provided by the database server to the application server. Related apparatus, systems, techniques and articles are also described.

公开(公告)号：US20170147705A1

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

申请号：US14946664

申请日：2015-11-19

Applicant: SAP SE

Inventor： Romans Kasperovics ,  Tobias Mindnich ,  Cornelia Kinder ,  Christoph Weyerhaeuser ,  Thomas Fischer

IPC: G06F17/30

CPC classification number: G06F17/30404

Abstract: Based on received input, a vertex table of the database layer and a vertex key column in the vertex table can be identified. The vertex key column defines vertices of a graph representation. Also based on the received input, an edge table of the database layer, an edge key column in the edge table, a source column in the edge table, and a target column in the edge table can be identified. The source column and target column define relationships between vertices of the plurality of vertices. Within a graph workspace object, graph relationships linking the vertices defined by the vertex key column via edges defined by the source column and target column in the edge table can be assigned, and the graph workspace can be generated in a higher level programming layer based on the graph workspace object.

公开(公告)号：US20170139989A1

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

申请号：US14945207

申请日：2015-11-18

Applicant: SAP SE

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

IPC: G06F17/30

CPC classification number: G06F16/24537 ,  G06F16/24545 ,  G06F16/24554

Abstract: A calculation engine of a database management system receives a calculation scenario. The calculation scenario comprises a query of a multiprovider that comprises a plurality of partitions. The calculation engine evaluates the query to identify a partition of the plurality of partitions that is not necessary for responding to the query. The calculation engine prunes the partition from the calculation scenario. The pruning comprises not loading or accessing the partition in the execution of the query and/or removing the filter constraint for the partition.

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