Loadable units for lazy manifestation of XML documents

• US 7,092,967 B1
• Filed: 09/27/2002
• Issued: 08/15/2006
• Est. Priority Date: 09/28/2001
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Pannala, Syam, Sedlar, Eric, Khaladkar, Bhushan, Chandrasekar, Sivasankaran, Murthy, Ravi, Agarwal, Nipun
• Primary Examiner(s): Corrielus, Jean M.
• Application Number:
  US10/256,777
• Time in Patent Office: 1,418 Days
• Field of Search: 707/101, 707/102, 707/104.1, 707/103.R, 715/517
• US Class Current: 1/1
• CPC Class Codes: G06F 16/80 of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML content-based retrieval of web data G06F16/95
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

Described herein is a system for “lazy” manifestation of XML documents. In lazy manifestation, only portions of an XML document that contain data of interest (e.g., a particular element or attribute requested by an application) are manifested. The term “manifesting a portion of an XML document” refers to creating an in-memory representation of the portion and incorporating it into existing in-memory representation of an XML document, if any. These portions are referred to herein as a loadable unit. A loadable unit is a set of one or more nodes in an XML document, where when there is need to manifest a node in the set, other nodes in the loadable unit are manifested too. Loadable units may, but not necessarily, correlate to content structures that store the nodes. A loadable unit may be the nodes whose content is contained in a row.

Claims

1. A method of lazily manifesting an XML document, the method comprising the steps of:

receiving a first request that requests a first node;

in response to receiving said first request, manifesting only a portion of said XML document within an in-memory representation of said XML document;

wherein each portion of multiple portions of said XML document belong to a separate loadable unit;

receiving one or more requests for a particular node that is not represented by a node within said in-memory representation and that belongs to a respective loadable unit; and

for each particular request of said one or more requests, incorporating within said in-memory representation a node representing the particular node requested by said each particular request by performing steps that include;

manifesting all nodes that belong to the respective loadable unit, said all nodes that belong to said respective loadable unit including said particular node and one or more other nodes that corresponds to a sibling or descendant element of said particular node.

2. The method of claim 1, wherein:

said particular node and said one or more other nodes are stored in a first data structure that also stores data used to locate a second data structure that stores another portion of said XML document; and

the steps further include loading into volatile memory said data used to locate said second data structure when said all nodes from the respective loadable unit of said particular node is manifested.

3. The method of claim 1, wherein:

said step of manifesting all nodes is performed by a database server; and

said XML document is stored in data structures managed by said database server.

4. The method of claim 3, wherein nodes stored in a row of a table constitute a loadable unit of said XML document.

5. The method of claim 1, wherein loadable units of said XML document are defined according to user input.

6. The method of claim 1, wherein an element of a VARRAY contains said particular node of interest and said one or more other nodes.

7. The method of claim 1, wherein a large object managed by a database server contains said particular node and said one or more other nodes.

8. The method of claim 1, wherein an object that resides in an object table managed by a database server contains said particular node and said one or more other nodes.

9. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1.

10. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2.

11. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3.

12. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4.

13. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5.

14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6.

15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7.

16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8.