公开(公告)号：US20190311060A1

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

申请号：US15946385

申请日：2018-04-05

Applicant: SAP SE

Inventor： Jan Bross ,  Marcus Paradies ,  Romans Kasperovics ,  Thomas Fischer

IPC: G06F17/30

Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.

公开(公告)号：US20180218088A1

公开(公告)日：2018-08-02

申请号：US15419866

申请日：2017-01-30

Applicant: SAP SE

Inventor： Thomas Fischer ,  Hinnerk Gildhoff ,  Romans Kasperovics ,  Cornelia Kinder ,  Marcus Paradies

IPC: G06F17/30

CPC classification number: G06F16/9024 ,  G06F16/2458 ,  G06F16/284

Abstract: A system for processing graph-modeled data in a relational database is provided. The system can include at least one data processor and at least one memory storing instructions that are executed by the at least one data processor. Executing the instructions can result in operations comprising: receiving a request to execute a graph algorithm operating on graph-modeled data stored at a relational database; and executing the graph algorithm within the relational database, the executing comprising use of an adjacency structure within the relational database. Related methods and articles of manufacture, including computer program products, are also provided.

公开(公告)号：US20200372021A1

公开(公告)日：2020-11-26

申请号：US16991945

申请日：2020-08-12

Applicant: SAP SE

Inventor： Jan Bross ,  Marcus Paradies ,  Romans Kasperovics ,  Thomas Fischer

IPC: G06F16/2458 ,  G06F16/901

Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.

公开(公告)号：US10831771B2

公开(公告)日：2020-11-10

申请号：US14792217

申请日：2015-07-06

Applicant: SAP SE

Inventor： Marcus Paradies ,  Michael Rudolf ,  Wolfgang Lehner

IPC: G06F16/00 ,  G06F16/248

Abstract: Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.

公开(公告)号：US20190303506A1

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

申请号：US15940570

申请日：2018-03-29

Applicant: SAP SE

Inventor： Jan Bross ,  Romans Kasperovics ,  Thomas Fischer ,  Cornelia Kinder ,  Marcus Paradies

IPC: G06F17/30

Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

公开(公告)号：US20190303505A1

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

申请号：US15940560

申请日：2018-03-29

Applicant: SAP SE

Inventor： Romans Kasperovics ,  Jan Bross ,  Thomas Fischer ,  Marcus Paradies ,  Cornelia Kinder

IPC: G06F17/30

Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

公开(公告)号：US20170011099A1

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

申请号：US14792217

申请日：2015-07-06

Applicant: SAP SE

Inventor： Marcus Paradies ,  Michael Rudolf ,  Wolfgang Lehner

IPC: G06F17/30

CPC classification number: G06F16/248

Abstract: Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.

Abstract translation: 这里公开了用于图形数据的交互式探索的系统，方法和计算机程序产品实施例。 实施例通过基于输入参数以任何数据库可读语言编译数据查询而进行操作。 然后，进行图形数据集的数据查询，但是当从输入参数产生的断点达到时停止。 停止数据查询包括从图形数据集分割数据子集。 然后显示数据子集。