公开(公告)号：US20190356760A1

公开(公告)日：2019-11-21

申请号：US16531766

申请日：2019-08-05

Applicant: SAP SE

Inventor： Daniel Ritter ,  Jan Bross

IPC: H04L29/06 ,  G06F9/54 ,  G06Q10/00 ,  G06F9/00

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.

公开(公告)号：US20190311065A1

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

申请号：US15946379

申请日：2018-04-05

Applicant: SAP SE

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

IPC: G06F17/30

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.

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