公开(公告)号：US20200349130A1

公开(公告)日：2020-11-05

申请号：US16399533

申请日：2019-04-30

Applicant: SAP SE

Inventor： Sandra Bracholdt ,  Joachim Gross ,  Volker Saggau ,  Jan Portisch

IPC: G06F16/21 ,  G06F16/22 ,  G06F16/25 ,  G06F16/28

Abstract: A metastructure for representing and manipulating or analyzing a data model is provided herein. A source representation of the first data model may be received. The source representation may include a representation of one or more structural components of the first data model, respectively having identifiers and types. One or more instances of a metastructure schema object datatype may be generated based on the one or more structural components of the source representation. Generating a given instance of the metastructure schema object datatype for a given structural component may include assigning a first identifier of the given structural component to the first data member of the given instance, determining a first type associated with the given structural component, and assigning the first type to the second data member of the given instance. The one or more instances of the metastructure schema object datatype may be stored in association.

公开(公告)号：US20200349129A1

公开(公告)日：2020-11-05

申请号：US16399477

申请日：2019-04-30

Applicant: SAP SE

Inventor： Sandra Bracholdt ,  Volker Saggau ,  Jan Portisch

IPC: G06F16/21 ,  G06F16/242 ,  G06F16/2457 ,  G06F16/182 ,  G06F16/25 ,  G06F16/901 ,  G06N20/00

Abstract: A method for aligning data model schemas is provided herein. A first schema and a second schema may be received. The schemas may include sets of nodes and links between the nodes. An anchor point between the first schema and the second schema may be received. A source node in the first schema may be identified to be mapped to the second schema. A source distance may be calculated between the source node and the anchor point in the first schema. Option distances may be calculated between the anchor point and the other nodes in the second schema. Penalty scores may be calculated for the option distances. A mapping node may be selected from the nodes in the second schema based on their penalty scores. A new anchor point identifying a correspondence between the source node and the mapping node may be stored.

公开(公告)号：US20200349128A1

公开(公告)日：2020-11-05

申请号：US16399363

申请日：2019-04-30

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Björn Pantel ,  Volker Saggau

IPC: G06F16/21 ,  G06F16/28 ,  G06F16/907

Abstract: A method for data model clustering is provided herein. A first representation of a data model may be received. Edge betweenness values may be determined for respective nodes in the first representation. At least one node in the first representation may be identified as a linking node based on the respective edge betweenness values. One or more linking nodes may be removed from the first representation, thereby forming at least a first cluster and a second cluster. Degrees for the respective remaining nodes may be calculated. Respective hub nodes may be identified for the respective clusters based on the respective degrees in the clusters. Respective descriptions may be generated for the respective clusters based on the respective hub nodes. A clustered representation of the first representation may be stored with the clusters and their respective descriptions.

公开(公告)号：US20240296079A1

公开(公告)日：2024-09-05

申请号：US18116750

申请日：2023-03-02

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Volker Saggau

IPC: G06F9/54 ,  G06F8/71

CPC classification number: G06F9/541 ,  G06F8/71

Abstract: A computer-implemented method can include registering a new version of an application programming interface (API) with an API registry, transforming the new version of the API to a first knowledge graph, comparing the first knowledge graph to a second knowledge graph to determine a difference graph, and sending the difference graph to selected entities who have subscribed to the API registry. The second knowledge graph can be transformed from a prior version of the application programming interface. The difference graph connects the second knowledge graph to the first knowledge graph and identifies changes from the second knowledge graph to the first knowledge graph.

公开(公告)号：US11755591B2

公开(公告)日：2023-09-12

申请号：US17395901

申请日：2021-08-06

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Ulrich Block ,  Volker Saggau

IPC: G06F16/2457 ,  G06F16/23 ,  G06F16/38

CPC classification number: G06F16/24573 ,  G06F16/2365 ,  G06F16/38

Abstract: Various examples are directed to systems and methods for administering data model metadata for a plurality of data models. A metadata service may receive a first retrieval request from a requesting system. The first retrieval request may comprise an indication of a first local object identifier referencing a definition of a first local object from a first data model and an indication of a target data model. The metadata service may retrieve a first record from a metadata identifier registry, where the first record comprises an indication of the first local object identifier and an indication of a first global object identifier corresponding to the first local object identifier. The metadata service may determine a second local object identifier referencing a definition of a second local object identifier referencing a definition of a second local object in the target data model and return the second local object identifier.

公开(公告)号：US11593392B2

公开(公告)日：2023-02-28

申请号：US16776407

申请日：2020-01-29

Applicant: SAP SE

Inventor： Jan Portisch ,  Ronald Boehle ,  Sandra Bracholdt ,  Volker Saggau

IPC: G06F7/02 ,  G06F16/00 ,  G06F16/25 ,  G06F16/2455 ,  G06N20/00 ,  G06F16/9035 ,  G06F16/28

Abstract: Transformation rule generation and validation functionality is provided herein. Transformation rules can be generated for one or more mappings in an alignment between a source database and a target database. The transformation rules can transform instance data from the source data model to a form matching the target data model. One or more transformation rules can be generated for a mapping between fields in a source database and a field in a target database. The transformation rules can be generated based on one or more source fields and a target field of a mapping, and one or more identified functions. Evaluating the transformation rules can include generating test data based on the transformation rules applied to instance data from the source database. The test data can be evaluated against instance data from the target database. The transformation rules and the evaluation results can be provided in a user interface.

公开(公告)号：US20230047681A1

公开(公告)日：2023-02-16

申请号：US17395901

申请日：2021-08-06

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Ulrich Block ,  Volker Saggau

IPC: G06F16/2457 ,  G06F16/23

Abstract: Various examples are directed to systems and methods for administering data model metadata for a plurality of data models. A metadata service may receive a first retrieval request from a requesting system. The first retrieval request may comprise an indication of a first local object identifier referencing a definition of a first local object from a first data model and an indication of a target data model. The metadata service may retrieve a first record from a metadata identifier registry, where the first record comprises an indication of the first local object identifier and an indication of a first global object identifier corresponding to the first local object identifier. The metadata service may determine a second local object identifier referencing a definition of a second local object identifier referencing a definition of a second local object in the target data model and return the second local object identifier.

公开(公告)号：US11422984B2

公开(公告)日：2022-08-23

申请号：US16399363

申请日：2019-04-30

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Björn Pantel ,  Volker Saggau

IPC: G06F16/21 ,  G06F16/28 ,  G06F16/907

Abstract: A method for data model clustering is provided herein. A first representation of a data model may be received. Edge betweenness values may be determined for respective nodes in the first representation. At least one node in the first representation may be identified as a linking node based on the respective edge betweenness values. One or more linking nodes may be removed from the first representation, thereby forming at least a first cluster and a second cluster. Degrees for the respective remaining nodes may be calculated. Respective hub nodes may be identified for the respective clusters based on the respective degrees in the clusters. Respective descriptions may be generated for the respective clusters based on the respective hub nodes. A clustered representation of the first representation may be stored with the clusters and their respective descriptions.

公开(公告)号：US20210318995A1

公开(公告)日：2021-10-14

申请号：US16848463

申请日：2020-04-14

Applicant: SAP SE

Inventor： Jan Portisch ,  Ronald Boehle ,  Volker Saggau ,  Sandra Bracholdt

IPC: G06F16/21

Abstract: Techniques and solutions are described for determining a set of elements of a second set that may correspond to a given element of a first set of elements. The elements can be, in specific examples, components of a database system, such as tables (or entities), attributes, or records. Significance metric values are calculated for elements in the first and second sets. The significance metric values can be a number of records in an entity or a number of read or write access operations for an entity or for a record of an entity. A significance metric value for the given element can be used at least in part to select elements of the second set as potential match candidates, based at least in part on significance metric values for elements of the second set. Selecting elements can include selecting elements based on a window of elements of the second set or a range of significance metric values.

公开(公告)号：US11144549B2

公开(公告)日：2021-10-12

申请号：US16221151

申请日：2018-12-14

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Volker Saggau

IPC: G06F16/00 ,  G06F16/2453 ,  G06F16/28 ,  G06F16/901

Abstract: A process for mining existing views to generate join statements is provided herein. A request to generate a join statement may be received, which may include a database object identifier to be part of the join statement. One or more views in the database may be identified, which may include the database object identifier. One or more edges in the one or more views may be identified, which may include the database object identifier. Scores for the one or more edges may be calculated. The edges may be filtered based on their scores according to one or more filtering rules. The filtered edges may be provided. A selected edge may be received, which may be selected from the provided filtered edges. The join statement may be generated in a query language. The join statement may be based on the selected edge. The generated join statement may be provided.