-
公开(公告)号：US11489905B2
公开(公告)日：2022-11-01
申请号：US16531766
申请日：2019-08-05
Applicant: SAP SE
Inventor： Daniel Ritter , Jan Bross
Abstract: The present disclosure describes methods, systems, and computer program products for data-centric integration modeling in an application integration system. One computer-implemented method includes receiving, by operation of an integration system, a logic integration program comprising a plurality of logic integration patterns that are defined in a data-centric logic integration language; generating a logical model graph based on the logic integration program, the logical model graph being runtime-independent; converting the logical model graph into a physical model graph, the physical model graph being runtime-specific; and generating logic integration runtime codes executable by the integration system based on the physical model graph.
-
公开(公告)号：US10776371B2
公开(公告)日：2020-09-15
申请号：US15946385
申请日：2018-04-05
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.
-
公开(公告)号：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.
-
公开(公告)号：US20200341738A1
公开(公告)日：2020-10-29
申请号：US16730600
申请日：2019-12-30
Applicant: SAP SE
Inventor： Daniel Ritter , Jan Bross
Abstract: The present disclosure describes methods, systems, and computer program products for performing integration logic programming. One computer-implemented method includes receiving, by operation of a middleware system, first information in a first format corresponding to a first application, applying, by operation of the middleware system, one or more integration logic programming (ILP) patterns to the first information, the one or more ILP patterns representing application integration semantics using a logic programming language, generating, by operation of the middleware system, a second information in response to applying the one or more ILP patterns to the first information, and outputting, by operation of the middleware system, the second information in a second format corresponding to a second application.
-
公开(公告)号：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.
-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：US11681716B2
公开(公告)日：2023-06-20
申请号：US16991945
申请日：2020-08-12
Applicant: SAP SE
Inventor： Jan Bross , Marcus Paradies , Romans Kasperovics , Thomas Fischer
IPC: G06F16/2458 , G06F16/901
CPC classification number: G06F16/2465 , G06F16/9024
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.
-
公开(公告)号：US11226794B2
公开(公告)日：2022-01-18
申请号：US16730600
申请日：2019-12-30
Applicant: SAP SE
Inventor： Daniel Ritter , Jan Bross
Abstract: The present disclosure describes methods, systems, and computer program products for performing integration logic programming. One computer-implemented method includes receiving, by operation of a middleware system, first information in a first format corresponding to a first application, applying, by operation of the middleware system, one or more integration logic programming (ILP) patterns to the first information, the one or more ILP patterns representing application integration semantics using a logic programming language, generating, by operation of the middleware system, a second information in response to applying the one or more ILP patterns to the first information, and outputting, by operation of the middleware system, the second information in a second format corresponding to a second application.
-
公开(公告)号：US10810259B2
公开(公告)日：2020-10-20
申请号：US15940560
申请日：2018-03-29
Applicant: SAP SE
Inventor： Romans Kasperovics , Jan Bross , Thomas Fischer , Marcus Paradies , Cornelia Kinder
IPC: G06F16/901 , G06F16/23 , G06F16/28 , G06F16/22
Abstract: A method for executing a graph algorithm 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.
-
公开(公告)号：US10769188B2
公开(公告)日：2020-09-08
申请号：US15946379
申请日：2018-04-05
Applicant: SAP SE
Inventor： Jan Bross , Marcus Paradies , Romans Kasperovics , Thomas Fischer , Markus Fath
IPC: G06F16/33 , G06F16/901
Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.
-
-
-
-
-
-
-
-
-
Search Results
13
records
(took 0.018 seconds)
