Sap Se

Umang Rawat

Romans Kasperovics

Roland Sedler

Gerald Franz

Hannes Jakschitsch

Matthias Hauck

Christian Bensberg

Daniel Ritter

Markus Fath

Stefano Belloni

Alan Braenzel

Frank Tetzel

Mathias Kemeter

Marc Jacob

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 generating, for a heterogeneous graph comprising a plurality of vertex tables and/or edge tables, an adjacency structure including a vertex adjacency structure specifying a plurality of neighboring vertices in the heterogeneous graph and an edge adjacency structure specifying a plurality of neighboring edges in the heterogeneous graph. A graph processing algorithm operating on the heterogeneous graph may be executed based on the adjacency structure. Related systems and computer program products are also provided.

Adjacency structure for heterogeneous graph data

Growing community of inventors

Heidelberg, Germany

Umang Rawat