Synchronizing multiple hierarchal data structures

• US 8,301,994 B1
• Filed: 09/12/2008
• Issued: 10/30/2012
• Est. Priority Date: 09/12/2008
• Status: Active Grant

• Current Assignee: Adobe Inc.
• Original Assignee: Adobe Systems Incorporated (Adobe Inc.)
• Inventors: Dhawan, Anuj, Shah, Abhishek
• Primary Examiner(s): Tran, Tuyetlien
• Assistant Examiner(s): Ayeni, Abimbola
• Application Number:
  US12/209,871
• Time in Patent Office: 1,509 Days
• Field of Search: 707/640, 707655-657, 707/829, 707690-696, 707/802, 707/808, 707/809, 707/758, 707/769, 707/792, 707/797, 707/795, 715/209, 715/764, 715/853, 715/854
• US Class Current: 715/229
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor

Abstract

Synchronization between multiple data repositories is described which retrieves tree structures that represent the hierarchical organization of the data repositories that will be or are synchronized. One of tree structures is parsed for data nodes, while the other tree structures are parsed for each such data node to find matching data nodes having corresponding hierarchies. Moved nodes are identified when a matching node is found that does not have the same hierarchy in its tree structure. Similarly, deleted nodes are identified when a node is found with no match in a controlling tree structure. Data structure lists are compiled noting matching relationships and hierarchies and also noting moved and deleted nodes and their relationships with the rest of the formerly corresponding nodes. Using these data structure lists, a synchronization interface is generated for display to a user that visually compares the synchronization of the multiple data repositories.

Claims

1. A method comprising:

retrieving a controlling tree structure and at least one other tree structure, wherein said controlling tree structure and said at least one other tree structure represent hierarchical organizations of synchronized data repositories;

traversing said controlling tree structure to identify each data node of said controlling tree structure;

for said each data node, searching said at least one other tree structure for a corresponding data node having a corresponding hierarchy in said at least one other tree structure;

responsive to finding said corresponding data node with said corresponding hierarchy, writing said each data node, said corresponding data node, and said corresponding hierarchy to a merged tree data structure;

responsive to finding said corresponding data node without said corresponding hierarchy, writing said corresponding data node and an unmatched hierarchy of said corresponding data node to a temporary tree data structure; and

generating a synchronization interface for display by combining said merged tree data structure and said temporary tree data structure, wherein said synchronization interface visually compares said controlling tree structure and said at least one other tree structure.

2. The method of claim 1 further comprising:

traversing the at least one other tree structure for an unmatched data node, wherein said unmatched data node does not correspond to any of said each data nodes of said controlling tree structure;

responsive to said unmatched data node being marked for synchronization, determining that a corresponding controlling data node of said controlling tree structure has been deleted; and

displaying in said synchronization interface a deleted node indicator in a presentation block representing said controlling tree structure, wherein said deleted node indicator corresponds to said unmatched data node.

3. The method of claim 2 further comprising:

responsive to said determining, writing said unmatched data node, said deleted node indicator, and said corresponding hierarchy to said merged tree data structure.

4. The method of claim 2 further comprising:

providing a synchronization selector on said synchronization interface in association with said deleted node indicator and said unmatched data node, wherein, in response to a user selecting said synchronization selector, said deleted node indicator and said unmatched data node are synchronized.

5. The method of claim 4 wherein said synchronization of said deleted node indicator and said unmatched data node comprises one of:

deleting said unmatched data node in said remaining ones;

or

re-installing a data file corresponding to said unmatched data node into said controlling tree structure at said corresponding hierarchy.

6. The method of claim 1 further comprising:

responsive to finding said corresponding data node with said unmatched hierarchy, displaying a moved node indicator on said synchronization interface in a presentation block representing said controlling tree structure, wherein said moved node indicator is positioned on said presentation block at a level corresponding to said unmatched hierarchy; and

displaying a new moved node indicator on said synchronization interface in a presentation area representing said at least one other tree structure, wherein said new moved node indicator is positioned on said presentation area corresponding to said each data node with a moved hierarchy.

7. The method of claim 6 further comprising:

removing a rendered synchronization selector from said synchronization interface between said moved node indicator and said corresponding data node; and

displaying a new synchronization selector on said synchronization interface between said each data node and said new moved node indicator, wherein upon selection of said new synchronization selector by a user, said controlling tree structure and said at least one other tree structure at synchronized.

8. The method of claim 7 wherein said synchronization of said two or more synchronized repositories comprises:

moving said corresponding data node from said moved hierarchy to said corresponding hierarchy in said remaining ones.

9. A synchronization system comprising:

a processor;

memory configured to operate with said processor;

a visual display configured to operate with said processor; and

a synchronization application stored on said memory and executable by said processor, wherein said synchronization application comprises;

a data interface component configured to communicate with two or more data repositories;

a mapping component configured to traverse two or more tree structures representing said two or more data repositories, wherein said mapping component traverses a plurality of data nodes of said two or more tree structures;

responsive to finding matching ones of said plurality of data nodes across said two or more tree structures, writing said matching ones to a merged tree data structure;

responsive to finding unmatching ones of said plurality of data nodes across said two or more tree structures, writing said unmatching ones to a temporary tree data structure; and

a synchronization interface component configured to generate a synchronization interface for display on said visual display based at least in part on said merged tree data structure and said temporary tree data structure, wherein said synchronization interface provides a visual comparison of said plurality of nodes of said two or more tree structures.

10. The synchronization system of claim 9:

wherein said mapping component is further configured to identify which of said plurality of nodes are marked for synchronization; and

wherein said synchronization interface component is further configured to use a temporary node placeholder representation for ones of said plurality of nodes marked for synchronization and to use an empty node placeholder representation for others of said plurality of nodes not marked for synchronization.

11. The synchronization system of claim 9:

wherein said synchronization interface component is further configured to display a moved node indicator on said synchronization interface at a location corresponding to said unmatched hierarchy of said matching node on one of said two or more tree structures; and

wherein said synchronization interface component is further configured to display a temporary node indicator at a location on said synchronization interface at said unmatched hierarchy corresponding to another of said two or more tree structures, such that display of said unmatched hierarchies is preserved.

12. The synchronization system of claim 9:

wherein said mapping component is further configured to identify deleted ones of said plurality of nodes on a controlling one of said two or more tree structures by finding an unmatched node on non-controlling ones of said two or more tree structures that is marked for synchronization; and

wherein said synchronization interface component is further configured to display a deleted node indicator in a visual representation of a controlling one of said two or more tree structures on said synchronization interface at a corresponding hierarchy to said unmatched node.

13. The synchronization system of claim 9 wherein said synchronization component further comprises:

a user interface component operable in conjunction with said synchronization interface component, wherein said user interface component directs said synchronization interface component to display user selectable objects in relation to ones of said plurality of nodes, wherein said user selectable objects allow a user to select which of said plurality of nodes to mark for synchronization.

14. A non-transitory computer readable medium comprising program code, the program comprising:

program code for retrieving a controlling tree structure and at least one other tree structure, wherein said controlling tree structure and said at least one other tree structure represent hierarchical organizations of synchronized data repositories;

program code for traversing said controlling tree structure to identify each data node of said controlling tree structure;

program code, executable for said each data node, for searching said at least one other tree structure for a corresponding data node having a corresponding hierarchy in said at least one other tree structure;

program code, executable responsive to finding said corresponding data node with said corresponding hierarchy, for writing said each data node, said corresponding data node, and said corresponding hierarchy to a merged tree data structure;

program code, executable responsive to finding said corresponding data node without said corresponding hierarchy, for writing said corresponding data node and an unmatched hierarchy of said corresponding data node to a temporary tree data structure; and

program code for generating a synchronization interface for display by combining said merged tree data structure and said temporary tree data structure, wherein said synchronization interface visually compares said controlling tree structure and said at least one other tree structure.

15. The non-transitory computer readable medium of claim 14 further comprising:

program code for traversing said remaining ones for an unmatched data node, wherein said unmatched data node does not correspond to any of said each data nodes of said controlling one;

program code, executable responsive to said unmatched data node being marked for synchronization, for determining that a corresponding controlling data node of said controlling one has been deleted; and

program code for displaying in said synchronization interface a deleted node indicator in a presentation block representing said controlling one, wherein said deleted node indicator corresponds to said unmatched data node.

16. The non-transitory computer readable medium of claim 15 further comprising:

program code, executable responsive to said determining, for writing said unmatched data node, said deleted node indicator, and said corresponding hierarchy to said merged tree data structure.

17. The non-transitory computer readable medium of claim 15 further comprising:

program code for providing a synchronization selector on said synchronization interface in association with said deleted node indicator and said unmatched data node, wherein, in response to a user selecting said synchronization selector, said deleted node indicator and said unmatched data node are synchronized.

18. The non-transitory computer readable medium of claim 17 wherein said synchronization of said deleted node indicator and said unmatched data node comprises one of:

program code for deleting said unmatched data node in said remaining ones;

or

program code for re-installing a data file corresponding to said unmatched data node into said controlling one at said corresponding hierarchy.

19. The non-transitory computer readable medium of claim 14 further comprising:

program code, executable responsive to finding said corresponding data node with said unmatched hierarchy, for displaying a moved node indicator on said synchronization interface in a presentation block representing said controlling one, wherein said moved node indicator is positioned on said presentation block at a level corresponding to said unmatched hierarchy; and

program code for displaying a new moved node indicator on said synchronization interface in a presentation area representing said at least one other tree structure, wherein said new moved node indicator is positioned on said presentation area corresponding to said each data node with a moved hierarchy.

20. The non-transitory computer readable medium of claim 19 further comprising:

program code for removing a rendered synchronization selector from said synchronization interface between said moved node indicator and said corresponding data node; and

program code for displaying a new synchronization selector on said synchronization interface between said each data node and said new moved node indicator, wherein upon selection of said new synchronization selector by a user, said controlling tree structure and said at least on other tree structure are synchronized.

21. The non-transitory computer readable medium of claim 20 wherein said synchronization of said two or more synchronized repositories comprises:

program code for moving said corresponding data node from said moved hierarchy to said corresponding hierarchy in said remaining ones.