CANONICAL DATA MODEL FOR ITERATIVE EFFORT REDUCTION IN BUSINESS-TO-BUSINESS SCHEMA INTEGRATION

    公开(公告)号:US20170220698A1

    公开(公告)日:2017-08-03

    申请号:US15484652

    申请日:2017-04-11

    Applicant: SAP SE

    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.

    Canonical data model for iterative effort reduction in business-to-business schema integration

    公开(公告)号:US09626451B2

    公开(公告)日:2017-04-18

    申请号:US15056346

    申请日:2016-02-29

    Applicant: SAP SE

    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.

    MAPPING FOR COLLABORATIVE CONTRIBUTION
    3.
    发明申请
    MAPPING FOR COLLABORATIVE CONTRIBUTION 审中-公开
    绘制合作贡献

    公开(公告)号:US20160189105A1

    公开(公告)日:2016-06-30

    申请号:US14755120

    申请日:2015-06-30

    Applicant: SAP SE

    CPC classification number: G06Q10/107 H04L12/1827 H04L51/046 H04L51/063

    Abstract: Techniques for managing communication between businesses include selecting a source message guideline including a first plurality of elements; selecting a target message guideline including a second plurality of elements; selecting a business context corresponding to the source message guideline; generating a plurality of potential mapping entities between the first plurality of elements and the second plurality of elements; and selecting mapping entities from the plurality of potential mapping entities based on an accuracy threshold of the mapping entities.

    Abstract translation: 用于管理业务之间的通信的技术包括选择包括第一多个元素的源消息准则; 选择包括第二多个元素的目标消息指南; 选择与源消息指南相对应的业务环境; 在所述第一多个元素和所述第二多个元素之间生成多个潜在的映射实体; 以及基于所述映射实体的精度阈值从所述多个潜在映射实体中选择映射实体。

    Mapping for collaborative contribution

    公开(公告)号:US10192202B2

    公开(公告)日:2019-01-29

    申请号:US14755120

    申请日:2015-06-30

    Applicant: SAP SE

    Abstract: Techniques for managing communication between businesses include selecting a source message guideline including a first plurality of elements; selecting a target message guideline including a second plurality of elements; selecting a business context corresponding to the source message guideline; generating a plurality of potential mapping entities between the first plurality of elements and the second plurality of elements; and selecting mapping entities from the plurality of potential mapping entities based on an accuracy threshold of the mapping entities.

    LABELING ENTITIES IN A CANONICAL DATA MODEL
    5.
    发明申请

    公开(公告)号:US20180011879A1

    公开(公告)日:2018-01-11

    申请号:US15710699

    申请日:2017-09-20

    Applicant: SAP SE

    CPC classification number: G06F16/213

    Abstract: Enterprises express the concepts of their electronic business-to-business (B2B) communication in differently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.

    Labeling entities in a canonical data model

    公开(公告)号:US10545930B2

    公开(公告)日:2020-01-28

    申请号:US15710699

    申请日:2017-09-20

    Applicant: SAP SE

    Abstract: Enterprises express the concepts of their electronic business-to-business (B2B) communication in differently structured ontology-like schemas. Collaborations benefit from merging the common concepts into semantically unique Business Entities (BEs) in a merged schema. Methods and systems for labeling the merged schema with descriptive, yet short and unique names, are described. A heuristically ranked list of descriptive candidate phrases for each BE is derived locally from the names and descriptions of the underlying concepts. A semantically unique candidate phrase is assigned to each BE that discriminates it from the other BEs by employing a constraint satisfaction problem solver.

Patent Agency Ranking