Sap Se

Jan Bross

Marcus Paradies

Romans Kasperovics

Thomas Fischer

Daniel Ritter

Cornelia Kinder

Markus Fath

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.

Extended path finding operations on graph data

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.

Data-centric integration modeling

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.

Relational logic integration

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.

Adaptable adjacency structure for querying graph data

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.

Graph data derivatives

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.

Growing community of inventors

Karlsruhe, Germany

Jan Bross