Method and system for updating hierarchical data structures

• US 20050256893A1
• Filed: 04/28/2005
• Published: 11/17/2005
• Est. Priority Date: 04/30/2004
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Perry, Russell
• Application Number:
  US11/117,110
• Publication Number:
  US 20050256893A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/282 Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes
• CPC Class Codes: G06F 16/9027 Trees

Abstract

Embodiments of the present disclosure provide systems and method for compressing a first data object. Briefly described, one embodiment of a method for compressing a first data object, among others, can be broadly summarized by the following steps: determining respective differences to be applied to at least one template that allow the first data object to be reconstructed; and forming a further data object identifying the at least one template together with the respective differences to be applied to the at least one template. Other methods and systems are also provided.

Claims

1. A method of compressing a first data object, comprising the steps of:

determining respective differences to be applied to at least one template that allow the first data object to be reconstructed; and

forming a further data object identifying the at least one template together with the respective differences to be applied to the at least one template.

2. A method as claimed in claim 1, in which there are a plurality of templates, and in which at least one of the templates identifies at least one further template, and the respective differences are to be applied to the at least one of the templates and the at least one further template.

3. A method as claimed in claim 1, in which there are a plurality of templates and in which the first data object comprises at least two parts, and each part comprises one of the templates together with respective differences applied to that template.

4. A method as claimed in claim 3, in which at least one of the parts identifies at least one more of the parts in a hierarchical fashion.

5. A method as claimed in claim 1, in which the respective differences include at least one indication of an item of data structure and data content which is to be modified in the at least one template.

6. A method as claimed in claim 1, in which there are a plurality of templates, the respective differences include at least one indication of an item of data structure having data content to be added to one of the templates, and the data content identifies at least one further template.

7. A method as claimed in claim 1, in which an item of data structure within one of the at least one template is associated with an identifier which is unique within that template, and each respective difference identifies the identifier of the item of data structure to which the respective difference is to be applied.

8. A method as claimed in claim 1, in which each template includes a unique identification, and the further data object identifies the unique identification of each template to which the respective differences are to be applied.

9. A method as claimed in claim 8, in which the unique identification of each template is a hash value of that template.

10. A method as claimed in claim 1, in which there are a plurality of templates and in which the further data object comprises a plurality of sub-sections arranged in a hierarchical fashion, each sub-section containing respective differences to be applied to one of the templates and an identification of that template.

11. A method as claimed in claim 1, further comprising the step of sending the further data object to one or more recipients.

12. A method as claimed in claim 1, in which at least one of the first data object, the further data object, and the at least one template is in XML format.

23. A computer program for controlling a programmable data processor to perform the method as claimed in claim 1.

24. A data carrier including the computer program as claimed in claim 23.

13. A data processor arranged to compress a first data object, wherein the data processor is arranged to:

determine respective differences to be applied to at least one template that allow the first data object to be reconstructed; and

form a further data object identifying the at least one template together with the respective differences to be applied to the at least one template.

14. A data processor as claimed in claim 13, in which there are a plurality of templates, and the data processor is arranged to form the further data object including respective differences to be applied to the templates.

15. A data processor as claimed in claim 14, in which at least one of the templates identifies at least one further template, and the data processor is arranged to form the further data object including respective differences to be applied to the at least one of the templates and the at least one further template.

16. A data processor as claimed in claim 13, in which the data processor includes within the further data object at least one indication of an item of data structure and data content to be modified in the at least one template.

17. A data processor as claimed in claim 14, in which the data processor includes within the further data object at least one indication of an item of data structure having data content to be added to one of the templates, and the data content identifies at least one more of the templates.

18. A data processor as claimed in claim 13, in which the data processor includes within the further data object respective differences, wherein each respective difference identifies a data item within a template, the respective difference being applied to the data item.

19. A data processor as claimed in claim 18, in which an item of data structure within one of the at least one template is associated with an identifier which is unique within that template, and the data processor includes within the further data object respective differences, wherein each respective difference identifies the identifier of the item to which the respective difference is to be applied.

20. A data processor as claimed in claim 13, in which each of the at least one template includes a unique identification, and the data processor includes within the further data object the unique identification of the at least one template to which the respective differences are to be applied.

21. A data processor as claimed in claim 14, in which the data processor forms the further data object with a plurality of sub-sections arranged in a hierarchical fashion, each sub-section containing respective differences to be applied to one of the templates and an identification of that template.

22. A data processor as claimed in claim 13, further arranged to send the compressed data object to at least one recipient.