公开(公告)号：US20240134887A1

公开(公告)日：2024-04-25

申请号：US17973311

申请日：2022-10-24

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt

IPC: G06F16/28 ,  G06F16/22 ,  G06F16/2458

CPC classification number: G06F16/288 ,  G06F16/2228 ,  G06F16/2477

Abstract: Various examples are directed to systems and methods for utilizing relationship data. A computing system may receive a time-dependent query against a knowledge graph data structure. The computing system may access confirmation data from the knowledge graph data structure, the confirmation data describing a first plurality of confirmation points-in-time at which the first test relationship is true. The computing system may determine that at least one of a beginning or an end of a first time period associated with a test relationship of the time-dependent query is not defined by the knowledge graph data structure. The computing system may determine a response to the first time-dependent query indicating a veracity of the test relationship at a test point-in-time using the first plurality of confirmation points-and-time.

公开(公告)号：US11526656B2

公开(公告)日：2022-12-13

申请号：US17387217

申请日：2021-07-28

Applicant: SAP SE

Inventor： Jan Portisch ,  Joachim Gross ,  Sandra Bracholdt

IPC: G06F40/151 ,  G06F16/2458 ,  G06F40/103

Abstract: Techniques and solutions are described for defining transformation specifications in a programming-language independent language and converting such specifications to one or more executable formats. The language can provide for defining rules and actions. Rules can refer to (e.g., be based at least in part on) data targets, such as attributes of a schema, whose identifiers are to be read or updated, or to other rules. Rules can be reused, and can recursively refer to one another, such that a large number of complex schema transformations can be accomplished using a series of first order logic statements. Actions can define what, and how, values will be changed when a predicate rule is satisfied. A transformation specification in the language can be parsed and selectively complied to one or more executable formats, including in programming languages such as the structured query language. Disclosed technologies can facilitate data transformations by non-technical users.

公开(公告)号：US11487721B2

公开(公告)日：2022-11-01

申请号：US16399533

申请日：2019-04-30

Applicant: SAP SE

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

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

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.

公开(公告)号：US11263187B2

公开(公告)日：2022-03-01

申请号：US16399477

申请日：2019-04-30

Applicant: SAP SE

Inventor： Sandra Bracholdt ,  Volker Saggau ,  Jan Portisch

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

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.

公开(公告)号：US11106861B2

公开(公告)日：2021-08-31

申请号：US16265063

申请日：2019-02-01

Applicant: SAP SE

Inventor： Jan Portisch ,  Joachim Gross ,  Sandra Bracholdt

IPC: G06F40/151 ,  G06F16/2458 ,  G06F40/103

Abstract: Techniques and solutions are described for defining transformation specifications in a programming-language independent language and converting such specifications to one or more executable formats. The language can provide for defining rules and actions. Rules can refer to (e.g., be based at least in part on) data targets, such as attributes of a schema, whose identifiers are to be read or updated, or to other rules. Rules can be reused, and can recursively refer to one another, such that a large number of complex schema transformations can be accomplished using a series of first order logic statements. Actions can define what, and how, values will be changed when a predicate rule is satisfied. A transformation specification in the language can be parsed and selectively complied to one or more executable formats, including in programming languages such as the structured query language. Disclosed technologies can facilitate data transformations by non-technical users.

公开(公告)号：US20200250260A1

公开(公告)日：2020-08-06

申请号：US16265063

申请日：2019-02-01

Applicant: SAP SE

Inventor： Jan Portisch ,  Joachim Gross ,  Sandra Bracholdt

IPC: G06F17/22 ,  G06F17/21 ,  G06F16/2458

Abstract: Techniques and solutions are described for defining transformation specifications in a programming-language independent language and converting such specifications to one or more executable formats. The language can provide for defining rules and actions. Rules can refer to (e.g., be based at least in part on) data targets, such as attributes of a schema, whose identifiers are to be read or updated, or to other rules. Rules can be reused, and can recursively refer to one another, such that a large number of complex schema transformations can be accomplished using a series of first order logic statements. Actions can define what, and how, values will be changed when a predicate rule is satisfied. A transformation specification in the language can be parsed and selectively complied to one or more executable formats, including in programming languages such as the structured query language. Disclosed technologies can facilitate data transformations by non-technical users.

公开(公告)号：US11954605B2

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

申请号：US17033357

申请日：2020-09-25

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Michael Hladik ,  Oliver Huth

IPC: G06N5/022 ,  G06F16/2455 ,  G06F16/36 ,  G06F16/901 ,  G06F16/906 ,  G06F18/22

CPC classification number: G06N5/022 ,  G06F16/2456 ,  G06F16/367 ,  G06F16/9024 ,  G06F16/906 ,  G06F18/22

Abstract: An intelligent labeling method is disclosed herein. The method can receive a plurality of input instances and access a knowledge graph comprising a plurality of nodes and a plurality of edges connecting the plurality of nodes. The plurality of nodes represent objects and the edges represent relationship between the objects. For at least some selected input instances, the method can identify respective matching objects represented by corresponding nodes of the knowledge graph. A selected input instance shares a common label with the corresponding matching object. For identified matching objects, the method can identify a common class object represented by a corresponding node of the knowledge graph. A percentage of identified matching objects are descendants of the common class object, and the percentage is greater than a predefined threshold. The method can associate a label of the common class object with the plurality of input instances.

公开(公告)号：US11620271B2

公开(公告)日：2023-04-04

申请号：US17400042

申请日：2021-08-11

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt

IPC: G06F16/22 ,  G06F11/34 ,  G06F16/28 ,  G06F16/21

Abstract: A computer-implemented method includes representing a plurality of database tables as respective vectors in a multi-dimensional vector space, receiving an indication that a first database table represented by a first vector and a second database table represented by a second vector are related to each other, moving the respective vectors representing the plurality of database tables in the multi-dimensional vector space in response to the indication, and grouping the plurality of database tables into one or more table clusters based on positions of the respective vectors representing the plurality of database tables in the multi-dimensional vector space.

公开(公告)号：US20230073312A1

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

申请号：US17470988

申请日：2021-09-09

Applicant: SAP SE

Inventor： Jan Portisch ,  Sandra Bracholdt ,  Volker Saggau

IPC: G06F16/21 ,  G06F16/28

Abstract: A computer-implemented method includes receiving a request of data records for a data schema, obtaining a schema alignment which maps the data schema to a subset of an ontology of a knowledge graph, generating at least one query based on the subset of the ontology of the knowledge graph, obtaining a list of data records by executing the at least one query on the knowledge graph to obtain a list of data records, and persisting the list of data records to the data schema.

公开(公告)号：US11599517B2

公开(公告)日：2023-03-07

申请号：US16920260

申请日：2020-07-02

Applicant: SAP SE

Inventor： Jan Portisch ,  Volker Saggau ,  Sandra Bracholdt

IPC: G06F16/00 ,  G06F16/22

Abstract: A variety of scenarios for generating mock data based on original data are described. Characteristics of the original data can be reflected in the mock data without having access to the actual original data. Instead, statistical artifacts representing the original data can be used to instantiate reconstructed database tables. In relational database scenarios, foreign key relationships can be preserved even if the actual values are not known. The reconstructed database tables can be used as mock data in a variety of circumstances, including testing, and is especially useful to recreate characteristics of the original data when the original data cannot be made available for size, confidentiality, or privacy reasons.