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

• US 9,311,429 B2
• Filed: 07/23/2013
• Issued: 04/12/2016
• Est. Priority Date: 07/23/2013
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Dietrich, Michael, Lemcke, Jens, Stuhec, Gunther
• Primary Examiner(s): Bowen, Richard
• Application Number:
  US13/948,391
• Publication Number:
  US 20150032777A1
• Time in Patent Office: 994 Days
• Field of Search: 707/798
• US Class Current: 1/1
• CPC Class Codes: G06F 16/25 Integrating or interfacing systems involving database management systems
• CPC Class Codes: G06F 16/282 Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 10/067 Enterprise or organisation modelling

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.

Claims

1. A computer-implemented method comprising:

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;

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;

generating a canonical data model (CDM) by applying a relevance rating to the nodes of the UDM based on a received context in a user request, wherein the generated CDM is an excerpt from the UDM with nodes containing at least one value consistent with the received context, and wherein the CDM is used as a bridge language with consistent and semantically unambiguous meaning of data structures and data elements used by two or more interfacing software applications executing on different computing systems; and

continuously maintaining the CDM based on guides and mappings received from one or more external data stores.

2. The method of claim 1, further comprising applying context logic to the CDM to generate a domain-specific CDM view.

3. The method of claim 2, further comprising deriving a message guide from the domain-specific CDM view.

4. The method of claim 3, further comprising storing the derived message guide into the UDM.

5. The method of claim 1, further comprising applying transitive mappings to the UDM to generate a mapping proposal.

6. The method of claim 5, further comprising deriving a mapping from the generated mapping proposal.

7. The method of claim 6, further comprising storing the derived mapping into the UDM.

8. A non-transitory, computer-readable medium storing computer-readable instructions executable by a computer and operable to:

receive the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory;

process 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;

determine 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;

generate a canonical data model (CDM) by applying a relevance rating to the nodes of the UDM based on a received context in a user request, wherein the generated CDM is an excerpt from the UDM with nodes containing at least one value consistent with the received context, and wherein the CDM is used as a bridge language with consistent and semantically unambiguous meaning of data structures and data elements used by two or more interfacing software applications executing on different computing systems; and

continuously maintain the CDM based on guides and mappings received from one or more external data stores.

9. The medium of claim 8, further operable to apply context logic to the CDM to generate a domain-specific CDM view.

10. The medium of claim 9, further operable to derive a message guide from the domain-specific CDM view.

11. The medium of claim 10, further operable to store the derived message guide into the UDM.

12. The medium of claim 8, further operable to apply transitive mappings to the UDM to generate a mapping proposal.

13. The medium of claim 12, further operable to derive a mapping from the generated mapping proposal.

14. The medium of claim 13, further operable to store the derived mapping into the UDM.

15. A system, comprising:

a memory configured to contain a unified data model (UDM);

at least one computer interoperably coupled with the memory and configured to;

receive the plurality of source hierarchical schemas, each source hierarchical schema being stored as a computer-readable document in computer-readable memory;

process 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;

determine 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;

generate a canonical data model (CDM) by applying a relevance rating to the nodes of the UDM based on a received context in a user request, wherein the generated CDM is an excerpt from the UDM with nodes containing at least one value consistent with the received context, and wherein the CDM is used as a bridge language with consistent and semantically unambiguous meaning of data structures and data elements used by two or more interfacing software applications executing on different computing systems; and

continuously maintain the CDM based on guides and mappings received from one or more external data stores.

16. The system of claim 15, further configured to apply context logic to the CDM to generate a domain-specific CDM view.

17. The system of claim 16, further configured to derive a message guide from the domain-specific CDM view.

18. The system of claim 17, further configured to store the derived message guide into the UDM.

19. The system of claim 15, further configured to apply transitive mappings to the UDM to generate a mapping proposal.

20. The system of claim 19, further configured to derive a mapping from the generated mapping proposal.

21. The system of claim 20, further configured to store the derived mapping into the UDM.