-
1.发明申请公开(公告)号：US20170220698A1
公开(公告)日：2017-08-03
申请号：US15484652
申请日：2017-04-11
Applicant: SAP SE
Inventor： Michael Dietrich , Jens Lemcke , Gunther Stuhec
CPC classification number: G06F16/9024 , G06F16/25 , G06F16/282 , G06Q10/067
Abstract: The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas. One computer-implemented method includes receiving the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory, processing, using a computer, the source hierarchical schemas to generate a merged graph, the merged graph comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, and determining, using the computer, that the merged graph includes one or more conflicts and, in response, resolving each conflict of the one or more conflicts to generate a computed-transitive-edge-free, conflict-free merged graph as a unified data model (UDM), wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes.
-
2.发明授权公开(公告)号：US09626451B2
公开(公告)日：2017-04-18
申请号：US15056346
申请日：2016-02-29
Applicant: SAP SE
Inventor： Michael Dietrich , Jens Lemcke , Gunther Stuhec
CPC classification number: G06F17/30958 , G06F17/30557 , G06F17/30589 , G06Q10/067
Abstract: The present disclosure describes methods, systems, and computer program products for providing and maintaining an evolving canonical data model (CDM) which consolidates current knowledge of the correspondences of existing schemas. One computer-implemented method includes receiving the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory, processing, using a computer, the source hierarchical schemas to generate a merged graph, the merged graph comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, and determining, using the computer, that the merged graph includes one or more conflicts and, in response, resolving each conflict of the one or more conflicts to generate a computed-transitive-edge-free, conflict-free merged graph as a unified data model (UDM), wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes.
-
Search Results
2
records
(took 0.032 seconds)
