发明公开
EP2830009A1 A canonical data model for iterative effort reduction in business-to-business schema integration
审中-公开
Kanonisches Datenmodell zur iterativen Aufwandsverringerung in einer Business-to-Business-Schema-Integration
- 专利标题： A canonical data model for iterative effort reduction in business-to-business schema integration
- 专利标题（中）： Kanonisches Datenmodell zur iterativen Aufwandsverringerung in einer Business-to-Business-Schema-Integration
-
申请号： EP14002493.6申请日： 2014-07-17
-
公开(公告)号： EP2830009A1公开(公告)日： 2015-01-28
- 发明人: Dietrich, Michael , Lemcke, Jens , Stuhec, Gunther
- 申请人： SAP SE
- 申请人地址： Dietmar-Hopp-Allee 16 69190 Walldorf DE
- 专利权人： SAP SE
- 当前专利权人： SAP SE
- 当前专利权人地址： Dietmar-Hopp-Allee 16 69190 Walldorf DE
- 代理机构： Müller-Boré & Partner Patentanwälte PartG mbB
- 优先权： US201313948391 20130723
- 主分类号： G06Q10/06
- IPC分类号： G06Q10/06 ; G06F17/30
摘要：
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.
信息查询
