Client apparatus for updating data

• US 8,312,077 B2
• Filed: 11/15/2007
• Issued: 11/13/2012
• Est. Priority Date: 11/18/2006
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Gale, Martin J., Bedi, Bharat Veer
• Primary Examiner(s): Backer, Firmin
• Assistant Examiner(s): Emdadi, Keyvan
• Application Number:
  US11/940,455
• Publication Number:
  US 20080120368A1
• Time in Patent Office: 1,825 Days
• Field of Search: 709/203, 715/229, 1/1
• US Class Current: 709/203
• CPC Class Codes: G06F 16/957 Browsing optimisation, e.g. caching or content distillation
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 40/194 Calculation of difference between files

Abstract

A client apparatus receives first data from a server and later receives second data from the same server in response to a refresh invocation. The client apparatus parses the received data to generate logical structures representing the data and then compares the logical structures using a tree walking algorithm. Where a difference is found between the first data and second data, the first data is updated using the second data and rendered at the client apparatus.

Claims

1. A client apparatus programmed for processing an electronic document for display to a user, said electronic document comprising a number of nodes logically arranged in a tree structure with a number of levels in which each node in a lower level has a relationship to a node in a higher level, the apparatus comprising:

a receiver for receiving first data via a network, said first data comprising a first version of said electronic document, and for subsequently receiving a refresh of the first data, said refresh of the first data comprising second data comprising a second version of said electronic document;

a comparator for determining whether there is a difference between the first data and the second data by comparing corresponding nodes from said first and second versions of said electronic document; and

an updater, responsive to the comparator determining that there is a difference, for updating the first data with the second data,

in which, upon finding a node that differs between said first and second versions of said electronic document, the comparator does not compare nodes at any lower level that are related to the node that differs between said first and second versions of said electronic document.

2. A client apparatus according to claim 1, further comprising a renderer for rendering at least one of the first data and the second data.

3. A client apparatus according to claim 2, further comprising:

a storage device; and

a parser for storing the first data and the second data in said storage device and parsing the first data and the second data to obtain a first logical structure and a second logical structure respectively.

4. A client apparatus according to claim 3, wherein the comparator accesses the first logical structure and the second logical structure in order to compare the first data and the second data.

5. A client apparatus according to claim 4, wherein the comparator compares at least one attribute of the first logical structure and the second logical structure.

6. A client apparatus according to claim 5, wherein said at least one attribute comprises at least one of a name, a child node, and a number of child nodes.

21. A client apparatus according to claim 1, in which each said node has a type, types of said nodes comprising:

element nodes, text nodes and attribute nodes.

22. A client apparatus according to claim 1, wherein said comparator is programmed to use a tree waking algorithm based on said tree structure of said nodes of said electronic document to compare said corresponding nodes from said first and second versions of said electronic document.

23. A client apparatus according to claim 1, in which the updater replaces the node that differs and any related nodes at any lower level in said first version with the node from said second version and any related nodes at any lower level of the second version.

7. A method for updating first data comprising a first version of an electronic document defined by a series of nodes logically arranged in a tree structure with a number of levels in which each node in a lower level has a relationship to a node in a higher level and for invoking a refresh of the first data, wherein, in response to the refresh invocation, second data is received and comprises a second version of said electronic document, the method comprising:

comparing the first data and the second data by comparing corresponding nodes from said first and second versions of said electronic document;

determining whether there is a difference between the first data and the second data; and

updating, in response to determining that there is a difference, nodes from the first data with corresponding nodes from the second data,

in which updating nodes from the first data with corresponding nodes from the second data comprises replacing a node that differs and any related nodes at any lower level in said first version with the corresponding node from said second data version and any related nodes at any lower level of the second version, in which, upon finding a node that differs between said first and second versions of said electronic document, the comparator does not compare nodes at any lower level that are related to the node that differs between said first and second versions of said electronic document.

8. A method according to claim 7, further comprising rendering at least one of the first data and the second data.

9. A method according to claim 8, further comprising:

storing the first data and the second data in a storage device; and

parsing the first data and the second data to obtain a first logical structure and a second logical structure, respectively.

10. A method according to claim 9, wherein comparing the first data and the second data further comprises accessing the first logical structure and the second logical structure.

11. A method according to claim 10, wherein comparing the first data and the second data further comprises comparing at least one attribute of the first logical structure and the second logical structure.

12. A method as claimed in claim 11, wherein said at least one attribute comprises at least one of:

a name, a child node, and a number of child nodes.

13. A method as claimed in claim 12, wherein the first logical structure and the second logical structure are trees and wherein accessing the first logical structure and the second logical structure further comprises executing a tree walking algorithm.

14. A computer program product for updating data in a client computer system for receiving first data comprising a first version of an electronic document defined by a series of nodes logically arranged in a tree structure with a number of levels in which each node in a lower level has a relationship to a node in a higher level and for invoking a refresh of the first data, wherein, in response to the refresh invocation, the client computer system is operable to receive second data comprising a second version of said electronic document, said computer program product comprising a physical computer usable medium having computer usable program code embodied therewith, said computer usable program code comprising:

computer usable program code that compares the first data and the second data by comparing corresponding nodes from said first and second versions of said electronic document;

computer usable program code that determines whether there is a difference between the first data and the second data; and

computer usable program code that, in response to a determination that there is a difference, updates nodes from the first data with corresponding nodes from the second data,

in which the computer usable program code that determines whether there is a difference between the first data and the second data comprises computer usable program code that utilizes a tree walking algorithm based on said tree structure of said nodes of the electronic document to compare corresponding nodes from said first and second versions of said electronic document, in which, upon finding a node that differs between said first and second versions of said electronic document, the comparator does not compare nodes at any lower level that are related to the node that differs between said first and second versions of said electronic document.

15. A computer program product according to claim 14 further comprising computer usable program code configured to render at least one of the first data and the second data.

16. A computer program product according to claim 15 further comprising further comprising:

computer usable program code configured to store the first data and the second data in a storage device; and

computer usable program code configured to parse the first data and the second data to obtain a first logical structure and a second logical structure respectively.

17. A computer program product according to claim 16 wherein the computer usable program code configured to compare the first data and the second data further comprises computer usable program code configured to access the first logical structure and the second logical structure.

18. A computer program product according to claim 17 wherein the computer usable program code configured to compare the first data and the second data further comprises computer usable program code configured to compare at least one attribute of the first logical structure and the second logical structure.

19. A computer program product according to claim 18 wherein the at least one attribute comprises at least one of a name, a child node, and a number of child nodes.

20. A computer program product according to claim 19 wherein the computer usable program code configured to compare the first and the second data further comprises computer usable program code configured to execute a tree walking algorithm.