Method, system, and program for determining whether data has been modified

• US 20040044702A1
• Filed: 08/29/2002
• Published: 03/04/2004
• Est. Priority Date: 08/29/2002
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Yur, Jyh-shiarn, Ng, Yip-Hing, Rosett, Michael Harris, Ferreira Alves, Luis Antonio
• Granted Patent: US 7,117,491 B2
• Time in Patent Office: Days
• US Class Current: 707/203
• CPC Class Codes: G06F 16/2358 Change logging, detection, and notification replication G06F16/27
• 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

Provided are a method, system, and program for determining whether data has been modified. One node associated with at least one data unit and a last version number is received. A data structure having a plurality of nodes is processed, wherein there is one node associated with each data unit and at least one node that is capable of aggregating one or more nodes, and wherein version numbers are associated with the nodes. A determination is made from the data structure of one node that is associated with the data units associated with the received node. A determination is then made that at least one data unit associated with the received node has been modified if the received last version number is less than a version number of the determined node.

Claims

1. A computer implemented method for determining whether data has been modified, comprising:

receiving one node associated with at least one data unit and a last version number;

processing a data structure having a plurality of nodes, wherein there is one node associated with each data unit and at least one node that is capable of aggregating one or more nodes, wherein version numbers are associated with the nodes;

determining from the data structure one node that is associated with the data units associated with the received node; and

determining that the at least one data unit associated with the received node has been modified if the received last version number is less than a version number of the determined node.

2. The method of claim 1, further comprising:

determining whether the received last version number is less than a first node version number in the data structure before determining one node that is associated with the data units associated with the received node; and

determining that the received node has not been modified if the received last version number is not less than the first node version number.

3. The method of claim 2, wherein the step of determining one node that is associated with the data units associated with the received node is performed if the received last version number is less than the first node version number.

4. The method of claim 1, wherein determining one node that is associated with the data units associated with the received node comprises determining the node in the processed data structure that matches the received node.

5. The method of claim 1, wherein receiving one node comprises receiving a plurality of nodes, wherein the steps of determining one node that is associated with the data units associated with the received node and determining whether the at least one data unit associated with the received node has been modified is performed for each received node.

6. The method of claim 1, wherein the node and last version number are received with a synchronization request, further comprising:

returning data units associated with the received node to the synchronization request if the at least one data unit associated with the received node is determined to have been modified.

7. The method of claim 6, wherein the synchronization request is received from a client system maintaining a local client database that is a subset of a master database maintained by a server system, wherein the data units comprise tables in the local database, wherein the server system performs the steps to determine whether the at least one data unit associated with the received node has been modified, and wherein the server system returns the data units associated with the received node from the master database to the client system.

8. The method of claim 1, wherein the data structure indicates a relationship of nodes, wherein one node is directly associated with each data unit, and wherein further aggregate nodes aggregate any one or more nodes in the data structure.

9. The method of claim 8, wherein determining one node that is associated with the received node comprises determining one node in which the received node is aggregated if there is a node in which the received node is aggregated or determining the node in the data structure that matches the received node, further comprising:

if the received last version number is less than the version number of the determined node and the received node is aggregated in the determined node, then further performing;

(i) determining a further node in which the received node is aggregated if there is one node not yet considered in which the received node is aggregated or a determination of the node in the data structure that matches the received node; and

(ii) determining whether the received last version number is less than the version number of the further determined node.

10. The method of claim 9, further comprising:

returning indication that the received node has not been modified if the received last version number is not less than the version number of one determined node.

11. The method of claim 8, further comprising:

determining an update to one data unit;

setting the version number of the node directly associated with the data unit to an incremented highest version number for a node in the data structure; and

for each aggregate node that aggregates the node directly associated with the data unit, setting the version number of the aggregate node to the incremented highest version number if the aggregate node does not aggregate one other node having a verison number greater than the incremented highest version number.

12. The method of claim 8, wherein the nodes are arranged in the data structure in a tree data structure, wherein each aggregate node is the parent to at least one other aggregate node or one node that is directly associated with one data unit.

13. The method of claim 12, further comprising:

determining whether the received last version number is less than a root node version number in the tree data structure before determining one node that is associated with the data units associated with the received node; and

determining that the received node has not been modified if the received last version number is not less than the root node version number.

14. The method of claim 13, wherein determining one node that is associated with the received node comprises determining one child node to the root node of which the received node is a descendant or which is the received node, and further comprising:

if the received last version number is not less than the version number of the determined child node, then determining that the received node has not been modified.

15. The method of claim 14, further comprising:

if the received last version number is less than the version number of the determined child node and the received node is a descendant of the determined child node, then determining a further child of the previously determined child node of which the received node is the descendent to determine whether the received last version number is less than the version number of the determined further child node, wherein further child nodes having the received node as a descendant are considered until either the determined child node is the received node or the received version number is not less than the version number of the determined further child node.

16. The method of claim 14, further comprising

if the received last version number is less than the version number of the determined child node and the child node is the received node, then determining that the received node has been modified.

17. A system for determining whether data has been modified, comprising:

a computer readable medium including a data structure having a plurality of nodes, wherein there is one node associated with each data unit and at least one node that is capable of aggregating one or more nodes, wherein version numbers are associated with the nodes;

means for receiving one node associated with at least one data unit and a last version number;

means for determining from the data structure one node that is associated with the data units associated with the received node; and

means for determining that the at least one data unit associated with the received node has been modified if the received last version number is less than a version number of the determined node.

18. The system of claim 17, further comprising:

means for determining whether the received last version number is less than a first node version number in the data structure before determining one node that is associated with the data units associated with the received node; and

means for determining that the received node has not been modified if the received last version number is not less than the first node version number.

19. The system of claim 17, wherein the means for determining one node that is associated with the data units associated with the received node determines the node in the processed data structure that matches the received node.

20. The system of claim 17, wherein the node and last version number are received with a synchronization request, further comprising:

returning data units associated with the received node to the synchronization request if the at least one data unit associated with the received node is determined to have been modified.

21. The system of claim 17, wherein the data structure indicates a relationship of nodes, wherein one node is directly associated with each data unit, and wherein further aggregate nodes aggregate any one or more nodes in the data structure.

22. The system of claim 21, wherein the means for determining one node that is associated with the received node determines one node in which the received node is aggregated if there is a node in which the received node is aggregated or determining the node in the data structure that matches the received node, further comprising:

means for performing, if the received last version number is less than the version number of the determined node and the received node is aggregated in the determined node;

(i) determining a further node in which the received node is aggregated if there is one node not yet considered in which the received node is aggregated or a determination of the node in the data structure that matches the received node; and

(ii) determining whether the received last version number is less than the version number of the further determined node.

23. The system of claim 21, further comprising:

means for determining an update to one data unit;

means for setting the version number of the node directly associated with the data unit to an incremented highest version number for a node in the data structure; and

means for setting, for each aggregate node that aggregates the node directly associated with the data unit, the version number of the aggregate node to the incremented highest version number if the aggregate node does not aggregate one other node having a verison number greater than the incremented highest version number.

24. The system of claim 21, wherein the nodes are arranged in the data structure in a tree data structure, wherein each aggregate node is the parent to at least one other aggregate node or one node that is directly associated with one data unit.

25. The system of claim 24, further comprising:

means for determining whether the received last version number is less than a root node version number in the tree data structure before determining one node that is associated with the data units associated with the received node; and

means for determining that the received node has not been modified if the received last version number is not less than the root node version number.

26. An article of manufacture computer implemented method for determining whether data has been modified, wherein the article of manufacture causes operations to be performed, the operations comprising:

receiving one node associated with at least one data unit and a last version number;

processing a data structure having a plurality of nodes, wherein there is one node associated with each data unit and at least one node that is capable of aggregating one or more nodes, wherein version numbers are associated with the nodes;

determining from the data structure one node that is associated with the data units associated with the received node; and

determining that the at least one data unit associated with the received node has been modified if the received last version number is less than a version number of the determined node.

27. The article of manufacture of claim 26, further comprising:

determining whether the received last version number is less than a first node version number in the data structure before determining one node that is associated with the data units associated with the received node; and

determining that the received node has not been modified if the received last version number is not less than the first node version number.

28. The article of manufacture of claim 26, wherein determining one node that is associated with the data units associated with the received node comprises determining the node in the processed data structure that matches the received node.

29. The article of manufacture of claim 26, wherein the node and last version number are received with a synchronization request, further comprising:

returning data units associated with the received node to the synchronization request if the at least one data unit associated with the received node is determined to have been modified.

30. The article of manufacture of claim 26, wherein the data structure indicates a relationship of nodes, wherein one node is directly associated with each data unit, and wherein further aggregate nodes aggregate any one or more nodes in the data structure.

31. The article of manufacture of claim 30, wherein determining one node that is associated with the received node comprises determining one node in which the received node is aggregated if there is a node in which the received node is aggregated or determining the node in the data structure that matches the received node, further comprising:

if the received last version number is less than the version number of the determined node and the received node is aggregated in the determined node, then further performing;

(i) determining a further node in which the received node is aggregated if there is one node not yet considered in which the received node is aggregated or a determination of the node in the data structure that matches the received node; and

(ii) determining whether the received last version number is less than the version number of the further determined node.

32. The article of manufacture of claim 30, further comprising:

determining an update to one data unit;

setting the version number of the node directly associated with the data unit to an incremented highest version number for a node in the data structure; and

for each aggregate node that aggregates the node directly associated with the data unit, setting the version number of the aggregate node to the incremented highest version number if the aggregate node does not aggregate one other node having a verison number greater than the incremented highest version number.

33. The article of manufacture of claim 30, wherein the nodes are arranged in the data structure in a tree data structure, wherein each aggregate node is the parent to at least one other aggregate node or one node that is directly associated with one data unit.

34. The article of manufacture of claim 33, further comprising:

determining whether the received last version number is less than a root node version number in the tree data structure before determining one node that is associated with the data units associated with the received node; and

determining that the received node has not been modified if the received last version number is not less than the root node version number.

35. The article of manufacture of claim 34, wherein determining one node that is associated with the received node comprises determining one child node to the root node of which the received node is a descendant or which is the received node, and further comprising:

if the received last version number is not less than the version number of the determined child node, then determining that the received node has not been modified.

36. The article of manufacture of claim 35, further comprising:

if the received last version number is less than the version number of the determined child node and the received node is a descendant of the determined child node, then determining a further child of the previously determined child node of which the received node is the descendent to determine whether the received last version number is less than the version number of the determined further child node, wherein further child nodes having the received node as a descendant are considered until either the determined child node is the received node or the received version number is not less than the version number of the determined further child node.