-
31.发明公开公开(公告)号：US20240296080A1
公开(公告)日：2024-09-05
申请号：US18116751
申请日：2023-03-02
Applicant: SAP SE
Inventor： Jan Portisch , Sandra Bracholdt , Volker Saggau
Abstract: A computer-implemented method can include generating a first knowledge graph from a first version of an application programming interface (API), generating a second knowledge graph from a second version of the API, identifying changes from the second knowledge graph to the first knowledge graph, and generating a difference graph based on the identified changes from the second knowledge graph to the first knowledge graph. The difference graph connects the second knowledge graph to the first knowledge graph via one or more revision edges, which represent the identified changes from the second knowledge graph to the first knowledge graph.
-
公开(公告)号：US20240135199A1
公开(公告)日：2024-04-25
申请号：US17973322
申请日：2022-10-24
Applicant: SAP SE
Inventor： Jan Portisch , Sandra Bracholdt , Michael Hoerisch
IPC: G06N5/02
CPC classification number: G06N5/022
Abstract: Various examples are directed to systems and methods for utilizing relationship data in a computing system. The computing system may extract first relationship data from a document and determine a first confidence value describing the first relationship data. The computing system may write the first relationship data to a knowledge graph data structure. The computing system may serve a first user interface page to a user computing device associated with a first user and receive feedback data describing an accuracy of the first relationship data. The computing system may modify a first confidence subunit of a triple data unit associated with the relationship to describe an updated confidence value based on the feedback data and a trust score of the first user.
-
公开(公告)号：US11907195B2
公开(公告)日：2024-02-20
申请号：US18113864
申请日：2023-02-24
Applicant: SAP SE
Inventor： Jan Portisch , Sandra Bracholdt
IPC: G06F16/22 , G06F16/28 , G06F16/21 , G06F16/2455 , G06F16/33 , G06F11/34 , G06F16/248
CPC classification number: G06F16/2282 , G06F11/3452 , G06F16/211 , G06F16/248 , G06F16/2456 , G06F16/285 , G06F16/3347
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 positions of 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.
-
公开(公告)号：US11726969B2
公开(公告)日：2023-08-15
申请号：US17939869
申请日：2022-09-07
Applicant: SAP SE
Inventor： Sandra Bracholdt , Joachim Gross , Volker Saggau , Jan Portisch
CPC classification number: G06F16/213 , G06F16/2282 , G06F16/254 , G06F16/284
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.
-
公开(公告)号：US20230177023A1
公开(公告)日：2023-06-08
申请号：US17543288
申请日：2021-12-06
Applicant: SAP SE
Inventor： Jan Portisch , Radu Purdel , Dirk Becker , Markus Bucher , Sandra Bracholdt
CPC classification number: G06F16/211 , G06N20/00
Abstract: In an example embodiment, a persistence model is utilized that allows the storage of value lists in a referenceable and reusable manner. This allows for two lifecycle options for value lists: (i) schema-dependent and (ii) schema-independent. Thus, the lifecycle of all involved entities (e.g., schemas, values, correspondences, etc.) is managed. This enables easier upgrades, downgrades, and sidegrades. The persistence is a directed graph, which comprises nodes and directed edges. This persistence can then be used to recommend additional correspondences to a user.
-
Patent Agency Ranking
公开(公告)号：US20220237185A1
公开(公告)日：2022-07-28
申请号：US17160153
申请日：2021-01-27
Applicant: SAP SE
Inventor： Jan Portisch , Sandra Bracholdt , Oliver Huth , Volker Saggau
IPC: G06F16/2458
Abstract: A computer-implemented method can receive a source table containing data tuples and a source schema defining attributes of the data tuples, and match the source schema to an ontology of a knowledge graph. The knowledge graph can include a plurality of instances and the ontology defines properties of the plurality of instances. The computer-implemented method can link the data tuples to respective instances in the knowledge graph, and identifying non-matching properties of the respective instances, wherein the non-matching properties are defined in the ontology and not matched to the source schema. The computer-implemented method can obtain property values associated with the non-matching properties from the knowledge graph, and add one or more of the non-matching properties and the associated property values to respective data tuples of the source table.
-
37.发明申请公开(公告)号：US20220101151A1
公开(公告)日：2022-03-31
申请号：US17033357
申请日：2020-09-25
Applicant: SAP SE
Inventor： Jan Portisch , Sandra Bracholdt , Michael Hladik , Oliver Huth
IPC: G06N5/02 , G06F16/901 , G06F16/2455 , G06F16/36 , G06F16/906 , G06K9/62
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.
-
公开(公告)号：US10901987B2
公开(公告)日：2021-01-26
申请号：US16220886
申请日：2018-12-14
Applicant: SAP SE
Inventor： Jan Portisch , Sandra Bracholdt , Volker Saggau
IPC: G06F16/00 , G06F16/242 , G06F16/955 , G06F16/22 , G06F16/26
Abstract: A process for mining existing views to generate new views is provided herein. A request to generate a proposed view combining a plurality of tables in a database may be received. One or more existing views in the database applicable to the request may be identified. The applicable existing views may include the plurality of tables in the request. One or more paths combining the plurality of tables may be identified in the respective one or more existing views. The identified one or more paths may be provided. One or more scores for the one or more paths may be generated and provided along with the one or more paths. A path may be automatically selected based on the scores or a path may be selected by a user. A view may be generated based on the selected path.
-
公开(公告)号：US20200349130A1
公开(公告)日：2020-11-05
申请号：US16399533
申请日：2019-04-30
Applicant: SAP SE
Inventor： Sandra Bracholdt , Joachim Gross , Volker Saggau , Jan Portisch
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.
-
-
-
-
-
-
-
-
-
Search Results
55
records
(took 0.023 seconds)
