CLIENT APPARTUS FOR UPDATING DATA

• US 20080120368A1
• Filed: 11/15/2007
• Published: 05/22/2008
• 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
• Granted Patent: US 8,312,077 B2
• Time in Patent Office: Days
• 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 for updating data for use with a system comprising a receiver for receiving first data and refresh invocation means for invoking a refresh of the first data, wherein the receiver, in response to the refresh invocation means, is operable to receive second data, the apparatus comprising:

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

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

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.

7. For use with a client system for receiving first data and invoking a refresh of the first data, wherein, in response to the refresh invocation, the system is operable to receive second data, a client computer method for updating data comprising:

comparing the first data and the second data;

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, the first data with the second data.

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 and invoking a refresh of the first data, wherein, in response to the refresh invocation, the client computer system is operable to receive second data, said computer program product comprising a computer usable medium having computer usable program code embodied therewith, said computer usable program code comprising:

computer usable program code configured to compare the first data and the second data;

computer usable program code configured to determine whether there is a difference between the first data and the second data; and

computer usable program code configured to, in response to a determination that there is a difference, update the first data with the second data.

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.