公开(公告)号：EP2830009A1

公开(公告)日：2015-01-28

申请号：EP14002493.6

申请日：2014-07-17

申请人： SAP SE

发明人： Dietrich, Michael ,  Lemcke, Jens ,  Stuhec, Gunther

IPC分类号： G06Q10/06 ,  G06F17/30

CPC分类号： G06F17/30958 ,  G06F17/30557 ,  G06F17/30589 ,  G06Q10/067

摘要： 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.

摘要翻译： 本公开描述了用于提供和维护演进规范数据模型（CDM）的方法，系统和计算机程序产品，其合并了现有模式的对应关系的当前知识。 一种计算机实现的方法包括接收多个源分层模式，每个源分层模式作为计算机可读文档存储在计算机可读存储器中，使用计算机处理，源分层模式以生成合并图，合并的 图形，其包括多个合并的节点，每个合并的节点基于来自所述源分层模式中的至少两个的一个或多个节点提供，并且使用所述计算机确定所述合并图包括一个或多个冲突，并且作为响应， 解决所述一个或多个冲突的每个冲突以产生作为统一数据模型（UDM）的计算无传递边缘的，无冲突的合并图，其中解决包括将一个或多个合并的节点分成合并的各个子集 节点。