Data synchronization

• US 9,317,518 B2
• Filed: 10/25/2012
• Issued: 04/19/2016
• Est. Priority Date: 10/25/2012
• Status: Active Grant

• Current Assignee: Micro Focus LLC (Open Text Corporation)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: Tzadikevitch, Gil, Nahum, Nimrod, Cohen, Ben
• Primary Examiner(s): Mofiz, Apu
• Assistant Examiner(s): Nguyen, Cindy
• Application Number:
  US13/660,643
• Publication Number:
  US 20140122422A1
• Time in Patent Office: 1,272 Days
• Field of Search: 707600-603
• US Class Current: 1/1
• CPC Class Codes: G06F 16/116 Details of conversion of file system types or formats
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641
• CPC Class Codes: G06F 16/1794 Details of file format conversion

Abstract

An example of synchronizing data can include converting a data tree structure into a dependency graph and reconciling nodes with a target data structure. Synchronizing data can include merging any duplicate information. Furthermore, synchronizing data can include keeping identifiers of reconciled information with non-reconciled information to locate the reconciled information when the remaining information is reconciled.

Claims

1. A non-transitory machine-readable medium storing a set of instructions executable by a processor to cause a computer to:

convert a source data tree structure into a dependency graph that comprises a dependency reference for each of a plurality of nodes of the dependency graph, wherein the dependency reference for each node comprises a number of parent dependency nodes and a number of child dependency nodes;

merge duplicate nodes in the dependency graph together into a merged node;

update the dependency graph based on the merge;

insert the merged node into a queue;

insert a child node of the merged node into the queue; and

reconcile the merged node in the queue with a first corresponding node of a target location based on the dependency reference of the merged node, and after the merged node is reconciled, reconcile the child node with a second corresponding node of the target location based on the dependency reference of the child node.

2. The non-transitory machine-readable medium of claim 1, wherein inserting the merged node includes relocating the merged node from the dependency graph to the queue when the node contains no parent dependency nodes before the merged node is subsequently reconciled with the target location.

3. The non-transitory machine-readable medium of claim 1, wherein reconciling the merged node comprises verifying that the merged node is in the target location according to an operation type for a particular type of record of the merged node.

4. The non-transitory machine-readable medium of claim 1, wherein reconciling the merged node comprises updating the merged node in the target location according to an operation type for a particular type of record of the merged node.

5. The non-transitory machine-readable medium of claim 1, wherein reconciling the nodes comprises holding a primary key identification (ID) with the target location for each reconciled node comprising a child dependency node.

6. The non-transitory machine-readable medium of claim 5, comprising updating all child dependency nodes with a real primary key ID of the corresponding reconciled node.

7. The method of claim 1, wherein reconciling the merged node and child node with the first and the second corresponding nodes of the target location comprises verifying the merged node and child node are already in the target location.

8. The non-transitory machine-readable medium of claim 1, wherein reconciling the notes includes marking as failed a node that comprises a parent dependency node that failed to be reconciled.

9. A method for synchronizing data, comprising:

utilizing a processor to execute instructions located on a non-transitory medium for;

converting a source data tree structure into a dependency graph that comprises a dependency reference for each node of a plurality of nodes;

placing a merged node of the plurality of nodes in a queue when the node has a number of dependencies;

removing the merged node from the queue to be reconciled;

reconciling the merged node in the dependency graph with a first corresponding node of a target location based on the dependency reference of the merged node; and

after reconciling the merged node, reconciling a child node of the merged node in the dependency graph with a second corresponding node of the target location based on the dependency reference of the child node.

10. The method of claim 9, wherein the dependency reference for each node comprises a number of parent dependency nodes and a number of child dependency nodes.

11. The method of claim 9, wherein the number of dependencies comprises no parent dependency nodes.

12. The method of claim 9, wherein a node in the queue is reconciled to the target location.

13. The method of claim 9, wherein the source data tree structure is organized by at least one of value, alphabet, and usage.

14. A system for synchronizing data, the system comprising a processing resource in communication with a non-transitory machine readable medium, wherein the non-transitory machine readable medium includes a set of instructions and wherein the processing resource is designed to carry out the set of instructions to:

convert a source data tree structure into a dependency graph that comprises a dependency reference for each of a plurality of nodes, wherein the dependency reference for each node comprises a number of parent dependency nodes and a number of child dependency nodes;

merge duplicate nodes in the dependency graph together into a merged node;

update the dependency graph based on the merge;

insert the merged node of the plurality of nodes in the dependency graph into a queue;

insert a child node of the merged node in the dependency graph into the queue;

remove the merged node and the child node out of the queue; and

reconcile the merged node removed from the queue with a first corresponding node of a target location based on the dependency reference of the merged node, and after the merged node is reconciled, reconcile the child node with a second corresponding node of the target location based on the dependency reference of the child node.

15. The system of claim 14, wherein reconciling the merged node and the child node comprises transferring the reconciled merged node and the reconciled child node to the target location.

16. The system of claim 14, wherein reconciling the merged node and the child node comprises holding a primary key identification (ID) with the target location for each reconciled node comprising a child dependency node and updating all child dependency nodes with a real primary key identification of the corresponding reconciled node.

17. The system of claim 16, wherein the updated node is inserted into a queue when filled with real primary key IDs that correspond to each of the parent dependency nodes of the updated node.

18. The system of claim 14, wherein the nodes are repeatedly reconciled until all nodes are transferred to the target location.

19. The system of claim 14, wherein the target location is a data structure different than the source data tree.

20. The system of claim 14, wherein reconciling the merged node and the child node removed from the queue with the first and the second corresponding nodes of the target location comprises verifying that the first and the second corresponding nodes already in the target location are updated.