Sap Se

Sap Ag

Cornelia Kinder

Christopher Schildt

Simon Lueders

Alexander Bunte

Volker Sauermann

Arne Harren

Michael Wintergerst

Jonathan Bregler

Andreas Kellner

Michael Schnaubelt

Daniel Kuntze

Le-Huan Stefan Tran

Vladislav Leonkev

Romans Kasperovics

Thomas Fischer

Marcus Paradies

Meinolf Block

Hinnerk Gildhoff

Ralph Debusmann

Jan Bross

Andreas Thumfart

Andre Hildebrandt

Christoph Weyerhaeuser

Stefan A Baeuerle

Tobias Mindnich

Anil Kumar Goel

Klaus Kopecz

Roger Killian-Kehr

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 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.

Adjacency structures for executing graph algorithms in a relational database

A system, a method, and a computer program product for deployment of objects are disclosed. At least one configuration for deploying of at least one artifact during runtime of an application is defined. The configuration includes at least one dependency for the artifact. The configuration is applied to the artifact. The artifact is deployed based on the applied configuration during runtime of the application. The configuration can include at least one of the following: a default configuration for the artifact and an explicit configuration for the artifact.

User-configurable database artifacts

Key values can be defined at design time (e.g. in a DTTI object) using character strings that include wildcard characters that define multi-dimensional key ranges. Wildcard characters can designate that a single variable character is to be inserted or that a range from zero to multiple characters can be inserted. The use of wildcards can make checks for key intersection non-trivial. During run time, the key values to be accessed from one or more tables are evaluated, and the operation proceeds. An error can occur if the presence of one or more wildcards in two key value strings used in an aggregation operation result in an overlap such that a same record is included more than once.

Determining an intersection between keys defining multi-dimensional value ranges

A system for processing graph-modeled data in a relational database is provided. In some implementations, the system performs operations comprising: receiving, from a first user, a request to define a graph algorithm operating on a graph workspace, the graph workspace comprising at least a portion of graph-modeled data stored at a relational database; applying a first security rule associated with the relational database, the applying comprising determining whether the first user has a privilege to define the graph algorithm operating on the graph workspace; and storing the graph algorithm at the relational database, when the first user is determined to have the privilege to define the graph algorithm operating on the graph workspace. Related methods and articles of manufacture, including computer program products, are also provided.

Graph-modeled data processing in a relational database

The current subject matter relates to an approach for splitting and rewriting database object bundles into database entities or subunits. For example, cyclical dependencies between a first parameter file and a second parameter file can be identified. The first parameter file can be partitioned into a plurality of subunits comprising a first subunit and a second subunit. The second parameter file, the first subunit, and the second subunit can be reordered to a call order that ensures there are no cyclical dependencies.

Transparently splitting and rewriting data-base object bundles to database entities

A system, a method, and a computer program product for deployment of objects are disclosed. Using a deployment infrastructure of a database system, a deployment container for deployment of at least one object at runtime of an application is generated. The container includes at least one artifact for the object and a container schema indicative of at least one dependency associated with the object. At least one deployment privilege is associated based on the container schema with the artifact for the object. The artifact of the deployment container is deployed based on the associated deployment schema during runtime of the application. The container can be an isolated container and an access privilege to an object can be requested based on a synonym for deployment purposes.

Database level containers

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.

Extensions of structured query language for database-native support of graph data

A system, a method, and a computer program product for deploying objects are disclosed. A file containing a plurality of artifacts for deploying during runtime of an application is defined. At least one dependency for at least one artifact in the plurality of artifacts is determined based on the defined file. A database object for implementation during runtime of the application is created based on the determined dependency. At least one change to the database object during runtime of the application is implemented. The artifact is deployed during runtime of the application based on the implemented change to the database object.

Deployment process plugin architecture

A system, a method, and a computer program product for deploying of objects are disclosed. At least one file containing a plurality of artifacts for deploying during runtime of an application is defined. Each artifact in the plurality of artifacts includes at least one object in the plurality of objects required to be deployed during runtime of the application. At least one dependency for at least one artifact in the plurality of artifacts is determined. An execution order for deployment of the plurality of artifacts is generated. The plurality of artifacts is deployed in accordance with the generated execution order.

Deployment of database objects

Design time artifacts ordered in a dependency tree according to a call order defined by a database application accessing data in a database can be classified as source and/or sink artifacts. The dependency tree can be traversed in a direction reverse of the call order to determine, for each sink artifact, one or more required source artifacts upon which the sink artifact depends and that is needed to provide correct data inputs for operation of the sink artifact. Based on the traversing, implicitly dependent sink artifacts positioned earlier in the call order that their required source artifacts can be identified, and a new call order can be defined in which all of the required source artifacts for the implicitly dependent sink artifact are called before the implicitly dependent sink artifact.

Sorting runtime calls of design time artifacts via data dependencies

A computer-implemented method, computer program product and system for configuration modeling with objects are disclosed. A base configuration of an application is modeled, to generate a configuration model that specifies parameters, types, structures, and boundary conditions of the base configuration of the application. The configuration model is stored in a database repository as a repository object that can be activated with configuration data. One or more extensions to the base configuration is modeled as one or more configuration model extensions. The one or more configuration model extensions are stored as repository objects linked to the repository object representing the configuration model.

Growing community of inventors

Walldorf, Germany

Cornelia Kinder