Sap Se

Sap Ag

Michael Rudolf

Wolfgang Lehner

Marcus Paradies

Christof Bornhoevd

Christof Bornhövd

Daniel Buchmann

Thomas Mueller

Karl Fuerst

Thomas Seufert

Kai Morich

Hannes Voigt

Sebastian Kook

This disclosure describes documenting modifications to configuration file that can affect (e.g., change) behavior of a component of a service provided by a database management system. The service can collect metadata associated with a request to modify a configuration file affecting the behavior of the component of the service. The service can modify the configuration file in response to the request. The modification can change the behavior of the component of the service. The service can generate data representing documentation of the modification to the configuration file and the metadata. The data can represent the documentation being configured for storage by the database management system. Related apparatuses, systems, methods, techniques and articles are also described.

Documenting modifications to configuration file

Disclosed herein are system, method, and computer program product embodiments for performing ad-hoc analytical queries of graph data. An embodiment operates by receiving a graph pattern for a subgraph of interest. The facts of interest are then selected from graph data based on the received graph pattern. Dimensions are then defined based on a dimension seed pattern and a set of level expressions, and measures are defined based on a computation function and an aggregation function. A graph cube is formed based on the selected facts and the defined dimensions and measures. Because the facts, dimensions, and measures of interest are defined at the time of an analytical query, a user does not have to define such facts, dimensions, and measures, or know which analytical queries will be of interest, at the time of data collection.

Ad-hoc analytical query of graph data

Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.

Interactive exploration of large graphs

Traversal hooks are based on an event-oriented programming model and provide an expressive mechanism to extend a graph traversal operator with domain-specific coding. A traversal operator can visit (i.e., traversal events) vertices and edges of a graph in an ordered manner. Related apparatus, systems, techniques and articles are also described.

Extending graph traversals with application logic

A system, computer-implemented method, and computer-readable storage medium for generating a block-based index, are provided. A block index is generated where the block index comprises a plurality of blocks and a block corresponds to a section of a graph column that stores a value. A block range vector is also generated for the index where the block range vector includes range information for the block that corresponds to the section of the graph and where the block-based index facilitates traversal of the graph column that searches for the value by constraining the traversal to the section of the graph.

Index structure to accelerate graph traversal

A system, computer-implemented method, and a computer-readable storage medium for a data graph traversal are provided. The input parameters for traversing the data graph are received. The data graph having a set of vertices and a set of edges are stored in a column based format in a memory cache of a computer device based on the input parameters is traversed. The traversal generates a set of traversed vertices that are the result of the graph traversal.

Graph traversal operator inside a column store

A system, computer-implemented method, and a computer-readable storage medium for a traversal of a property graph, are provided. The edge table of the property graph is divided into a plurality of fragments. A first fragment is selected for traversal using a set of selected vertices, where the traversal identifies a set of edges. Based on the set of edges, a set of adjacent vertices is determined during the traversal. A set of discovered vertices in the property graph is determined based on the set of selected vertices and the set of adjacent vertices.

Graph traversal operator and extensible framework inside a column store

A system includes reception of an instruction to access a column of a database table, determination that the column is not associated with the schema of the database table, determination of whether the schema of the database table is flexible or static, returning, if it is determined that the schema of the database table is static, of an error in response to the instruction, and, if it is determined that the schema of the database table is flexible, not returning an error in response to the instruction.

Growing community of inventors

Heidelberg, Germany

Michael Rudolf