Method and system for storing structured documents in their native format in a database

• US 8,150,818 B2
• Filed: 08/25/2003
• Issued: 04/03/2012
• Est. Priority Date: 08/25/2003
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Van Der Linden, Robbert C., Vickery, Brian S.
• Primary Examiner(s): Vo, Tim T
• Assistant Examiner(s): SMITH, GARRETT A
• Application Number:
  US10/648,760
• Publication Number:
  US 20050050059A1
• Time in Patent Office: 3,144 Days
• Field of Search: 707/100
• US Class Current: 707/705
• CPC Class Codes: G06F 16/86 Mapping to a database

Abstract

A method, computer readable medium, and system for storing a structured document in its native format in a database are provided. The method, computer readable medium, and system include receiving the structured document, generating a hierarchical node tree comprising a plurality of nodes, where the node tree represents the structured document, and storing the plurality of nodes in at least one record in the database.

Claims

1. A method for storing a structured document in its native format in a database, the method comprising:

receiving a structured document;

generating a hierarchical node tree comprising a plurality of nodes, wherein the node tree represents the structured document;

storing the plurality of nodes in at least one record in the database, and

storing the at least one record on at least one page, and

wherein each record comprises a node slot array, the node slot array including a plurality of node slots, each node slot including a pointer pointing to one of the plurality of nodes in the hierarchical node tree, wherein each page comprises a plurality of record slots, wherein each record slot includes a pointer pointing to a record stored on the page.

2. The method of claim 1, wherein generating the hierarchical node tree further comprises:

parsing the structured document into the plurality of nodes; and

linking each of the plurality of nodes via pointers to form the hierarchical node tree.

3. The method of claim 1, wherein each node is identified by an identifier comprising a record slot number corresponding to the record slot pointing to the record in which the node resides and a node slot number corresponding to the note slot pointing to the node.

4. The method of claim 1, wherein a node comprises a plurality of child pointers if the node has children, wherein each of the plurality of pointers points to a child node.

5. The method of claim 4, wherein a child pointer points to a node slot pointing to the child node if the child node is a separate node.

6. The method of claim 5, wherein a node slot in a first record in a first page points to a record slot in a second page and a node slot in a second record if the child node is a separate node stored in the second record on the second page.

7. The method of claim 4, wherein the node further comprises an in-lined character array.

8. The method of claim 7, wherein a child pointer describes the child by pointing to the in-lined character array.

9. The method of claim 4, wherein a child pointer describes the child and its value.

10. The method of claim 1, wherein the structured document is written in Extensible Markup Language.

11. A computer readable medium encoded with a computer program for storing a structured document in its native format in a database, the computer program comprising instructions for:

receiving a structured document;

generating a hierarchical node tree comprising a plurality of nodes, wherein the node tree represents the structured document;

storing the plurality of nodes in at least one record in the database,

storing the at least one record on at least one page, and

wherein each record comprises a node slot array, the node slot array including a plurality of node slots, each node slot including a pointer pointing to one of the plurality of nodes in the hierarchical node tree, wherein each page comprises a plurality of record slots, wherein each record slot includes a pointer pointing to a record stored on the page.

12. The computer readable medium of claim 11, wherein generating the hierarchical node tree further comprises:

parsing the structured document into the plurality of nodes; and

linking each of the plurality of nodes via pointers to form the hierarchical node tree.

13. The computer readable medium of claim 11, wherein each node is identified by an identifier comprising a record slot number corresponding to the record slot pointing to the record in which the node resides and a node slot number corresponding to the note slot pointing to the node.

14. The computer readable medium of claim 11, wherein a node comprises a plurality of child pointers if the node has children, wherein each of the plurality of pointers points to a child node.

15. The computer readable medium of claim 14, wherein a child pointer points to a node slot pointing to the child node if the child node is a separate node.

16. The computer readable medium of claim 15, wherein a node slot in a first record in a first page points to a record slot in a second page and a node slot in a second record if the child node is a separate node stored in the second record on the second page.

17. The computer readable medium of claim 14, wherein the node further comprises an in-lined character array.

18. The computer readable medium of claim 17, wherein a child pointer describes the child by pointing to the in-lined character array.

19. The computer readable medium of claim 14, wherein a child pointer describes the child and its value.

20. The computer readable medium of claim 11, wherein the structured document is written in Extensible Markup Language.

21. A system for storing a structured document in its native format in a database, the system comprising:

a computer system coupled to at least one data storage device;

a database management system in the computer system;

a storage mechanism in the database management system for receiving a structured document, generating a hierarchical node tree comprising a plurality of nodes, wherein the node tree represents the structured document, and storing the plurality of nodes in at least one record in the at least one data storage device,

wherein each page comprises a plurality of record slots, each of which includes a pointer pointing to a record stored on the page;

wherein each record is stored on a page; and

wherein each record comprises a node slot array, the node slot array including a plurality of node slots, each node slot including a pointer pointing to one of the plurality of nodes in the hierarchical node tree.

22. The system of claim 21, wherein the storage mechanism further comprises a parser for parsing the structured document into a plurality of nodes and a node tree generator for linking each of the plurality of nodes via pointers to form the hierarchical node tree.

23. The system of claim 21, wherein each node is identified by an identifier comprising a record slot number corresponding to the record slot pointing to the record in which the node resides and a node slot number corresponding to the note slot pointing to the node.

24. The system of claim 21, wherein a node comprises a plurality of child pointers if the node has children, wherein each of the plurality of pointers points to a child node.

25. The system of claim 24, wherein a child pointer points to a node slot pointing to the child node if the child node is a separate node.

26. The system of claim 24, wherein the node further comprises an in-lined character array.

27. The system of claim 26, wherein a child pointer fully describes the child by pointing to the in-lined character array.

28. The system of claim 21, wherein the structured document is written in Extensible Markup Language.

29. The system of claim 24, wherein a child pointer describes the child and its value.

30. The system of claim 25, wherein a node slot in a first record in a first page points to a record slot in a second page and a node slot in a second record if the child node is a separate node stored in the second record on the second page.