Sap Se

Christian Hengstler

Stefan Hesse

Martin Rosjat

Volodymyr Vasyutynskyy

A query relationship data structure (RELSTRUCT) generator configured to select a plurality of queries, each query structured for application against a database to yield a query result. The RELSTRUCT generator includes a query analyzer configured to identify query parts of individual queries, and determine for each query, a relation, if any, of an included query part to any query part of remaining queries of the plurality of queries. The RELSTRUCT generator also may create, for each query, a query relationship data structure in which the query is related to at least one other query of the plurality of queries, based on the determined relation of a query part of the query and a query part of the at least one other query of the plurality of queries.

Query relationship management

Techniques of consolidation and customization of graph-based models are disclosed. A first graph-based representation of a first model can comprise a first set of nodes corresponding to data items of the first model, and a second graph-based representation of a second model can comprise a second set of nodes corresponding to data items of the second model. Matching nodes between the first set of nodes and the second set of nodes can be identified. Matching topological features between the first set of nodes and the second set of nodes can be identified. Matching dependency characteristics between the first set of nodes and the second set of nodes can be identified. A third graph-based representation of a consolidated model can be created based on the matching nodes, the matching topological features, and the matching dependency characteristics.

Growing community of inventors

Dresden, Germany

Christian Hengstler