Sap Se

Gerald Franz

Roland Sedler

Hannes Jakschitsch

Bastian Erler

Romans Kasperovics

Umang Rawat

Matthias Hauck

Florian Schimmel

Christian Bensberg

Daniel Ritter

Jan Finis

Robert Brunel

Markus Fath

Stefano Belloni

Mathias Kemeter

Marc Jacob

Alan Braenzel

Frank Tetzel

The present invention relates to an improved database system architecture designed for generating and managing heterogeneous graphs. The system utilizes a document store in conjunction with a persistent adjacency index to enhance flexibility, adaptability, and transactional visibility during the generation and modification of complex graph structures. Data stored in the document store utilizes a flexible schema for storing data which improves the efficiency in both storing and retrieving data from the document store during graph-related processing tasks.

Graph processing using a document store

A method may include receiving a definition of a table user-defined function (TUDF) in a graph query language. The table user-defined function may be created based on the definition. For example, the creation of the table user-defined function may include checking and compiling the definition to generate executable code associated with the table user-defined function. Upon receiving a query including a relational query language statement invoking the table user-defined function, such as a structured query language select statement, the query may be executed on at least a portion of a graph data stored in a database. The executing of the query may include calling the executable code to execute the table user-defined function included in the relational query language statement. Related systems and computer program products are also provided.

Table user-defined function for graph data processing

A method may include receiving a workspace definition defining a graph workspace for a heterogeneous graph having a plurality of vertex tables and/or edge tables. Upon validating the workspace definition, the graph workspace for the heterogeneous graph may be created in accordance with the workspace definition. The graph workspace may include a label for each table of the plurality of vertex tables and/or edge tables comprising the heterogeneous graph. Each vertex and edge of the heterogeneous graph may be uniquely identified based on a label of a corresponding table and one or more key attributes. A graph processing algorithm operating on the heterogeneous graph may be executed based on the graph workspace. Related systems and computer program products are also provided.

Graph workspace for heterogeneous graph data

A method, a system, and a computer program product for querying graph data. A graph workspace object is identified. One or more parameters for executing a declarative language query are identified. Using the identified parameters, the declarative language query is executed on the identified graph workspace object. Based on the executed declarative language query, one or more tables responsive to a request to access graph data stored in a relational database are processed.

SQL interface for embedded graph subqueries

A method for traversing hierarchical data is provided. The method may include generating, based on a source table stored in a database, an index for traversing a graph corresponding to the source table. The source table may identify a parent node for each node in the graph. The generating of the index may include iterating over the source table to generate an inner node map. The inner node map may include at least one mapping identifying one or more children nodes descending from an inner node in the graph. The graph may be traversed based at least on the index. The index may enable the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph. Related systems and articles of manufacture, including computer program products, are also provided.

Index for traversing hierarchical data

A method, a system, and a computer program product for generating graphs using a stored procedure. One or more graph data tables are generated. A procedure having a predetermined name is generated. One or more inputs to the generated procedure includes the generated one or more graph data tables. The generated procedure includes one or more graph objects. The graph data tables are configured to be input to the graph objects. The generated procedure is stored. The stored generated procedure is executed using one or more graph data stored in a graph database.

Ad-hoc graph definition

Disclosed herein are system, method, and computer program product embodiments for the translation of a level based format, where each record contains a complete individual path from the highest to the lowest leaf level, to an annotated hierarchy through a generator function which through mapping and encoding on a level-by-level basis, keeping track of sibling links, is able to perform a depth-first pre-ranking order assessment of original data, to produce an annotated hierarchy which may be utilized by a user.

Level-based hierarchies

A table function can be received at a database system and applied to one or more data sources. The table function can have one or more generic input operators associated with a source data type of the one or more data sources. One or more output operators associated with a return set of data of the table function can be determined at function call compile time from the values passed to one or more generic input operators. The determining of the one or more output parameters can be based on one or more rules specified in the table function definition. The one or more output operators for the table function can be generated at function call compile time.

Enhanced table functions for database management systems

A selection of a generator function can be received. The generator function can be configured to be applied to source data to form a normalized tabular indexed data structure. The tabular indexed data structure can include a set of hierarchical attributes. A navigation function can be selected to be applied to the tabular indexed data structure to determine a navigation result. The navigation result can be provided to a user.

Hierarchical computations in relational database management systems

Performing hierarchical computations in relational database management systems, where the hierarchical computations are based on tabular input data that builds non-tree topologies by modifying the tabular input data to form tree topologies. One or more nodes, in a hierarchy of nodes, generated from tabular data, can have a non-tree-like topology. One or more attributes of entries in the tabular indexed data structure associated with the one or more nodes having the non-tree-like topology can be modified. The modified attributes can cause the tabular indexed data to form a tree-like topology. The modifying can be based on a type of non-tree-like topology of the one or more nodes having the non-tree-like topology. A navigation function can be selected and applied to the modified tabular indexed data structure to determine a navigation result for traversing the hierarchy of nodes. The navigation result can be provided and the hierarchy traversed.

Hierarchical computations of nodes having non-tree topologies in relational database management systems

A system includes a stored table comprising a plurality of rows and at least one column, each of the plurality of rows associated with a node of a hierarchy, and one of the at least one columns implicity representing a position of a row's associated node within the hierarchy, wherein a Structured Query Language query is received and, response to the query, one or more values of the one of the at least one columns are determined and one or more properties of the hierarchy are determined based on the one or more values.

Growing community of inventors

Walldorf, Germany

Gerald Franz