Consolidation and customization of graph-based models

Patent metadata

Field	Value
Publication number	US-9569869-B2
Application number	US-201414445398-A
Country	US
Kind code	B2
Filing date	Jul 29, 2014
Priority date	Jul 29, 2014
Publication date	Feb 14, 2017
Grant date	Feb 14, 2017

Abstract

Techniques of consolidation and customization of graph-based models are disclosed. A first graph-based representation of a first model can comprise a first set of nodes corresponding to data items of the first model, and a second graph-based representation of a second model can comprise a second set of nodes corresponding to data items of the second model. Matching nodes between the first set of nodes and the second set of nodes can be identified. Matching topological features between the first set of nodes and the second set of nodes can be identified. Matching dependency characteristics between the first set of nodes and the second set of nodes can be identified. A third graph-based representation of a consolidated model can be created based on the matching nodes, the matching topological features, and the matching dependency characteristics.

First claim

What is claimed is:

1. A computer-implemented method comprising:
accessing a first graph-based representation of a first model created by a first user, the first graph-based representation comprising a first set of nodes and connections between the nodes, each node in the first set of nodes corresponding to a data item of the first model;
accessing a second graph-based representation of a second model created by a second user, the second graph-based representation comprising a second set of nodes and connections between the nodes, each node in the second set of nodes corresponding to a data item of the second model;
identifying matching nodes between the first set of nodes and the second set of nodes;
identifying matching topological features between the first set of nodes and the second set of nodes;
identifying matching dependency characteristics between the first set of nodes and the second set of nodes;
creating, by a machine having a memory and at least one processor, a third graph-based representation of a consolidated model based on the matching nodes, the matching topological features, and the matching dependency characteristics;
identifying a conflict between the first graph-based representation of the first model and the second graph-based representation of the second model;
causing the third graph-based representation of the consolidated model to be displayed to a resolving user based on the identifying the conflict; and
enabling the resolving user to resolve the conflict by modifying the third graph-based representation of the consolidated model using the displayed third graph-based representation of the consolidated model.

2. The method of claim 1 , wherein the conflict is between at least one topological feature of the first set of nodes and at least one topological feature of the second set of nodes.

3. The method of claim 1 , wherein the conflict is between at least one dependency characteristic of the first set of nodes and at least one dependency characteristic of the second set of nodes.

4. The method of claim 1 , further comprising enabling a deriving user to derive a fourth graph-based representation of a derivative model from the third graph-based representation of the consolidated model.

5. The method of claim 4 , wherein enabling the deriving user to derive the fourth graph-based representation comprises enabling the deriving user to add a new node, modify at least one topological feature, and modify at least one dependency characteristic.

6. The method of claim 4 , further comprising merging the fourth graph-based representation of the derivative model with the third graph-based representation of the consolidated model to form a fifth graph-based representation of an updated consolidated model.

7. The method of claim 1 , wherein identifying matching nodes comprises performing a semantic matching technique or a schema matching technique.

8. The method of claim 1 , wherein the data items of the first model and the data items of the second model comprise concrete data objects.

9. The method of claim 1 , wherein the data items of the first model and the data items of the second model comprise abstract semantic concepts.

10. The method of claim 1 , further comprising enabling the resolving user to define criteria of consolidation, wherein the creating of the third graph-based representation of the consolidated model is further based on the criteria of consolidation.

11. A system comprising:
a machine having a memory and at least one processor; and
at least one module on the machine, the at least one module being configured to:
access a first graph-based representation of a first model created by a first user, the first graph-based representation comprising a first set of nodes and connections between the nodes, each node in the first set of nodes corresponding to a data item of the first model;
access a second graph-based representation of a second model created by a second user, the second graph-based representation comprising a second set of nodes and connections between the nodes, each node in the second set of nodes corresponding to a data item of the second model;
identify matching nodes between the first set of nodes and the second set of nodes;
identify matching topological features between the first set of nodes and the second set of nodes;
identify matching dependency characteristics between the first set of nodes and the second set of nodes;
create a third graph-based representation of a consolidated model based on the matching nodes, the matching topological features, and the matching dependency characteristics;
identify a conflict between the first graph-based representation of the first model and the second graph-based representation of the second model;
cause the third graph-based representation of the consolidated model to be displayed to a resolving user based on the identifying the conflict; and
enable the resolving user to resolve the conflict by modifying the third graph-based representation of the consolidated model using the displayed third graph-based representation of the consolidated model.

12. The system of claim 11 , wherein the conflict is between at least one topological feature of the first set of nodes and at least one topological feature of the second set of nodes or the conflict is between at least one dependency characteristic of the first set of nodes and at least one dependency characteristic of the second set of nodes.

13. The system of claim 11 , wherein the at least one module is further configured to enable a deriving user to derive a fourth graph-based representation of a derivative model from the third graph-based representation of the consolidated model.

14. The system of claim 13 , wherein the at least one module is further configured to enable the deriving user to add a new node, modify at least one topological feature, and modify at least one dependency characteristic.

15. The system of claim 13 , wherein the at least one module is further configured to merge the fourth graph-based representation of the derivative model with the third graph-based representation of the consolidated model to form a fifth graph-based representation of an updated consolidated model.

16. The system of claim 11 , wherein the at least one module is further configured to identify matching nodes by performing a semantic matching technique or a schema matching technique.

17. The system of claim 11 , wherein the data items of the first model and the data items of the second model comprise concrete data objects or abstract semantic concepts.

18. The system of claim 11 , wherein the at least one module is further configured to enable the resolving user to define criteria of consolidation, wherein the creating of the third graph-based representation of the consolidated model is further based on the criteria of consolidation.

19. A non-transitory machine-readable storage medium, tangibly embodying a set of instructions that, when executed by at least one processor, causes the at least one processor to perform a set of operations comprising:
accessing a first graph-based representation of a first model created by a first user, the first graph-based representation comprising a first set of nodes and connections between the nodes, each node in the first set of nodes corresponding to a data item of the first model;
accessing a second graph-based representation of a second model created by a second user, the second graph-based representation comprising a second set of nodes and connections bet

Assignees

• Hesse Stefan
• Rosjat Martin
• Vasyutynskyy Volodymyr
• Hengstler Christian
• Sap Se

Inventors

• Hesse Stefan
• Rosjat Martin
• Vasyutynskyy Volodymyr
• Hengstler Christian

Classifications

• G06T11/26 Primary

  Drawing of charts or graphs · CPC title

• G06Q10/00

  Administration; Management · CPC title

• G06T11/206 Primary

  Physics · mapped topic

• G06Q10/0633

  Workflow analysis · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title