Accelerating value-based lookup of XML document in XQuery

• US 7,836,098 B2
• Filed: 07/13/2007
• Issued: 11/16/2010
• Est. Priority Date: 07/13/2007
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Tarachandani, Asha, Baby, Thomas, Chandrasekar, Sivasankaran, Agarwal, Nipun
• Primary Examiner(s): Lu; Kuen S
• Assistant Examiner(s): PHAM, TUAN A
• Application Number:
  US11/827,801
• Publication Number:
  US 20090019077A1
• Time in Patent Office: 1,222 Days
• Field of Search: 707/803
• US Class Current: 707/803
• CPC Class Codes: G06F 16/8373 Query execution

Abstract

A method and apparatus for accelerating value-based lookups of XML documents in XQuery is provided. XML indices can help to optimize SQL queries of XML documents stored in object-relational databases. Certain SQL/XML functions such as XMLTABLE( ) use XQuery expressions to query XML documents. Previously, such queries could not use the XML index because the PATH table of the XML index was not defined for XQuery semantics. Techniques described herein extend the XML index for use with queries that require evaluation of XQuery expressions. Consequently, techniques described herein accelerate value-based lookups of XML documents in XQuery by introducing the possibility of an index-assisted evaluation of XQuery expressions.

Claims

1. A method comprising machine steps including:

for each particular node of a set of one or more nodes in a markup language document, storing an entry for the particular node in a first index; and

for each complex node that is in the set of nodes and has one or more child nodes, performing steps comprising;

identifying all simple nodes that are descendants of the complex node and that have no child nodes;

generating, based on the values of a plurality of the simple nodes, a representative node value for the complex node; and

associating the representative node value with an index entry in the first index for the particular complex node;

receiving a query conforming to a query language, wherein the query specifies a path-based expression and a target value;

identifying a set of entries in the first index that are associated with one or more nodes to which the path-based expression refers;

identifying, from the set of entries, a target entry having a representative node value that matches the target value;

returning a node associated with the target entry; and

wherein the steps are performed by one or more computing devices.

2. The method of claim 1, further comprising:

for each simple node that has no child nodes, associating a node value with an index entry in the first index for the simple node.

3. The method of claim 1, wherein the identifying, generating, and associating steps are executed in response to receiving a query and by executing an operator contained within the query.

4. The method of claim 1, wherein the first index comprises a relational database table, and wherein the associating steps further comprise storing the node values and the representative node values in a column of values in the table.

5. The method of claim 4, wherein said step of identifying, from the set of entries, a target entry having a representative node value that matches the target value, comprises:

identifying, from the column of values, a matched value that is the same as the target value.

6. The method of claim 1, wherein said set of entries comprises a set of rows in the first index that are associated with the one or more nodes to which the path-based expression refers.

7. The method of claim 1, wherein the path-based expression is written in XQuery and the query comprises XQuery operators.

8. The method of claim 7, wherein the query comprises a value-based lookup in XQuery.

9. The method of claim 1, further comprising:

storing the node values and the representative node values as keys in a second index, wherein each key is associated with one entry in the first index.

10. The method of claim 9, wherein the second index is a b-tree index.

11. The method of claim 9, wherein identifying, from the set of entries, a target entry having a representative node value that matches the target value, comprises:

identifying, from the keys, a matched value that is the same as the target value.

12. The method of claim 9, wherein identifying, from the set of entries, a target entry having a representative node value that matches the target value, comprises:

identifying, from the keys, matched values that are the same as the target value;

identifying from the second index a set of entries associated with the matched values;

identifying, from the set of entries of the second index associated with the matched values, a subset of entries that are associated with one or more nodes to which the path-based expression refers; and

returning one or more nodes associated with the subset of entries.

13. The method of claim 1, wherein the generated representative node value comprises a prefix of a concatenation of the vales of the plurality of the simple nodes, and wherein the prefix comprises the concatenation of the values of the plurality of the simple nodes up to a specified number of bytes.

14. The method of claim 1, wherein at least one of the plurality of simple nodes is a node that is a descendant but not a child of the complex node.

15. An apparatus for accelerating value-based lookups, comprising:

for each particular node of a set of one or more nodes in a markup language document, means for storing an entry for the particular node in a first index;

for each simple node that has no child nodes, means for associating a node value with an index entry in the first index for the simple node; and

for each complex node that is in the set of nodes and has one or more child nodes, means for performing steps comprising;

means for identifying all simple nodes that are descendants of the complex node and that have no child nodes;

means for generating, based on the values of a plurality of the simple nodes, a representative node value for the complex node; and

means for associating the representative node value with an index entry in the first index for the particular complex node;

means for receiving a query conforming to a query language, wherein the query specifies a path-based expression and a target value;

means for identifying a set of entries in the first index that are associated with one or more nodes to which the path-based expression refers;

means for identifying, from the set of entries, a target entry having a representative node value that matches the target value; and

means for returning a node associated with the target entry.

16. The apparatus of claim 15, further comprising:

for each simple node that has no child nodes, means for associating a node value with an index entry in the first index for the simple node.

17. A computer-readable storage that stores instructions which, when executed by one or more processors, cause the one of more processors to perform the steps of:

for each particular node of a set of one or more nodes in a markup language document, storing an entry for the particular node in a first index; and

for each complex node that is in the set of nodes and has one or more child nodes, performing steps comprising;

identifying all simple nodes that are descendants of the complex node and that have no child nodes;

generating, based on the values of a plurality of the simple nodes, a representative node value for the complex node; and

associating the representative node value with an index entry in the first index for the particular complex node;

receiving a query conforming to a query language, wherein the query specifies a path-based expression and a target value;

identifying a set of entries in the first index that are associated with one or more nodes to which the path-based expression refers;

identifying, from the set of entries, a target entry having a representative node value that matches the target value; and

returning a node associated with the target entry.

18. The computer-readable storage claim 17, further comprising instructions for:

for each simple node that has no child nodes, associating a node value with an index entry in the first index for the simple node.

19. The computer-readable storage of claim 17, wherein the identifying, generating, and associating steps are executed in response to receiving a query and by executing an operator contained within the query.

20. The computer-readable storage of claim 17, wherein the first index comprises a relational database table, and wherein the associating steps further comprise storing the node values and the representative node values in a column of values in the table.

21. The computer-readable storage of claim 20, wherein said step of identifying, from the set of entries, a target entry having a representative node value that matches the target value, comprises instructions for:

identifying, from the column of values, a matched value that is the same as the target value.

22. The computer-readable storage of claim 17, wherein said set of entries comprises a set of rows in the first index that are associated with the one or more nodes to which the path-based expression refers.

23. The computer-readable storage of claim 17, wherein the path-based expression is written in XQuery and the query comprises XQuery operators.

24. The computer-readable storage of claim 23, wherein the query comprises a value-based lookup in XQuery.

25. The computer-readable storage of claim 17, further comprising instructions for:

storing the node values and the representative node values as keys in a second index, wherein each key is associated with one entry in the first index.

26. The computer-readable storage of claim 25, wherein the second index is a b-tree index.

27. The computer-readable storage of claim 25, wherein identifying, from the set of entries, a target entry having a representative node value that matches the target value, comprises instructions for:

identifying, from the keys, a matched value that is the same as the target value.

28. The computer-readable storage of claim 25, further comprising wherein identifying, from the set of entries, a target entry having a representative node value that matches the target value, comprises instructions for:

identifying, from the keys, matched values that are the same as the target value;

identifying from the second index a set of entries associated with the matched values;

identifying, from the set of entries of the second index associated with the matched values, a subset of entries that are associated with one or more nodes to which the path-based expression refers; and

returning one or more nodes associated with the subset of entries.