System, method, and computer program product for querying XML documents using a relational database system

• US 20040044959A1
• Filed: 08/30/2002
• Published: 03/04/2004
• Est. Priority Date: 08/30/2002
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Shanmugasundaram, Jayavel, Shekita, Eugene Jon
• Application Number:
  US10/234,876
• Publication Number:
  US 20040044959A1
• Time in Patent Office: Days
• US Class Current: 715/513
• CPC Class Codes: G06F 16/83 Querying
• CPC Class Codes: G06F 16/86 Mapping to a database

Abstract

A technique enabling querying of XML documents in a relational database system via a reconstruction view allowing XML documents to be queried as though XML views of relational data. A single query processor can be used with all relational schema generation methods (whether or not using XML schema information) to seamlessly query across XML documents, relational data, and XML views of relational data; no special purpose query processor is required. The technique creates an XML document view, creates relational tables for storing XML documents using relational schema, shreds the XML documents and stores the XML documents as rows in the relational tables according to the relational schema, generates a reconstruction view over the relational tables to define how the shredded documents are to be virtually reconstructed, and processes queries over the stored XML documents as queries over the reconstruction view.

Claims

1. A method for querying XML documents in a relational database system, comprising the steps of:

creating an XML document view;

creating relational tables for storing XML documents using relational schema;

shredding said XML documents and storing said XML documents as rows in said relational tables according to said relational schema;

generating a reconstruction view over said relational tables to define how said shredded XML documents are to be virtually reconstructed; and

processing queries over said stored XML documents as queries over said reconstruction view.

2. The method of claim 1 wherein said relational schema may be generated by any number of generation methods, including those methods using a DTD, those methods using XML Schema, those methods ignoring any DTD, and those methods ignoring any XML Schema.

3. The method of claim 1 wherein said processing step processes queries over at least one of said XML documents, relational data, XML views of said relational data.

4. The method of claim 1 wherein a DTD is provided, comprising the further steps of:

recursively traversing a DTD graph for relational schema generation;

binding variables to said rows using an XQuery “

For”

clause;

creating XML element tags;

recursively invoking the above steps on child attributes and operator nodes and sub-element nodes to create XQuery fragments to reconstruct said nodes.

5. The method of claim 4 comprising the further steps of:

relating said sub-element nodes to respective parent nodes by a join;

ordering said sub-element nodes in the same way as said sub-element nodes appear in said XML documents using a sortby clause.

6. The method of claim 1 wherein XML schema information is not used, comprising the further steps of:

determining an edge pointing to a root element;

invoking a recursive function to build up document fragments rooted at a specific element, said recursive function including the further steps of

tagging said element;

producing character values associated with said element;

determining edges pointing to attributes of said element using a nested sub-query;

creating said attributes using an XQuery built-in function attribute;

determining edges pointing to a sub-element of said element using another nested sub-query and recursively invoking said recursive function for each said sub-element;

ordering said sub-elements.

9. The computer program product of claim 6, wherein said computer readable program means for processing queries processes queries over at least one of:

said XML documents, relational data, XML views of said relational data.

7. A computer program product for querying XML documents in a relational database system, comprising a computer readable storage medium having computer readable program means embodied in said medium, said computer readable program means comprising:

computer readable program means for creating an XML document view;

computer readable program means for creating relational tables for storing XML documents using relational schema;

computer readable program means for shredding said XML documents and storing said XML documents as rows in said relational tables according to said relational schema;

computer readable program means for generating a reconstruction view over said relational tables to define how said shredded XML documents are to be virtually reconstructed; and

computer readable program means for processing queries over said stored XML documents as queries over said reconstruction view.

8. The computer program product of claim 7, wherein said relational schema may be generated by any number of generation methods, including those methods using a DTD, those methods using XML Schema, those methods ignoring any DTD, and those methods ignoring any XML Schema.

10. The computer program product of claim 7 wherein a DTD is provided, further comprising:

computer readable program means for recursively traversing a DTD graph for relational schema generation;

computer readable program means for binding variables to said rows using an XQuery “

For”

clause;

computer readable program means for creating XML element tags;

computer readable program means for recursively invoking the above steps on child attributes and operator nodes and sub-element nodes to create XQuery fragments to reconstruct said nodes.

11. The computer program product of claim 10, further comprising:

computer readable program means for relating said sub-element nodes to respective parent nodes by a join;

computer readable program means for ordering said sub-element nodes in the same way as said sub-element nodes appear in said XML documents using a sortby clause.

12. The computer program product of claim 7, wherein XML schema information is not used, further comprising:

computer readable program means for determining an edge pointing to a root element;

computer readable program means for invoking a recursive function to build up document fragments rooted at a specific element, said recursive function including

computer readable program means for tagging said element;

computer readable program means for producing character values associated with said element;

computer readable program means for determining edges pointing to attributes of said element using a nested sub-query;

computer readable program means for creating said attributes using an XQuery built-in function attribute;

computer readable program means for determining edges pointing to a sub-element of said element using another nested sub-query and recursively invoking said recursive function for each said sub-element;

computer readable program means for ordering said sub-elements.

13. A general purpose computer including a data storage device with a computer usable medium having computer readable program means for querying XML documents in a relational database system, comprising:

computer readable program means for creating an XML document view;

computer readable program means for creating relational tables for storing XML documents using relational schema;

computer readable program means for shredding said XML documents and storing said XML documents as rows in said relational tables according to said relational schema;

computer readable program means for generating a reconstruction view over said relational tables to define how said shredded XML documents are to be virtually reconstructed; and

computer readable program means for processing queries over said stored XML documents as queries over said reconstruction view.

14. The computer of claim 13 wherein said relational schema may be generated by any number of generation methods, including those methods using a DTD, those methods using XML Schema, those methods ignoring any DTD, and those methods ignoring any XML Schema.

15. The computer of claim 13 wherein said computer readable program means for processing queries processes queries over at least one of said XML documents, relational data, XML views of said relational data.

16. The computer of claim 13 wherein a DTD is provided, further comprising:

computer readable program means for recursively traversing a DTD graph for relational schema generation;

computer readable program means for binding variables to said rows using an XQuery “

For”

clause;

computer readable program means for creating XML element tags;

computer readable program means for recursively invoking the above steps on child attributes and operator nodes and sub-element nodes to create XQuery fragments to reconstruct said nodes.

17. The computer of claim 16 further comprising:

computer readable program means for relating said sub-element nodes to respective parent nodes by a join;

computer readable program means for ordering said sub-element nodes in the same way as said sub-element nodes appear in said XML documents using a sortby clause.

18. The computer of claim 13 wherein XML schema information is not used, further comprising:

computer readable program means for determining an edge pointing to a root element;

computer readable program means for invoking a recursive function to build up document fragments rooted at a specific element, said recursive function including

computer readable program means for tagging said element;

computer readable program means for producing character values associated with said element;

computer readable program means for determining edges pointing to attributes of said element using a nested sub-query;

computer readable program means for creating said attributes using an XQuery built-in function attribute;

computer readable program means for determining edges pointing to a sub-element of said element using another nested sub-query and recursively invoking said recursive function for each said sub-element;

computer readable program means for ordering said sub-elements.

19. A system for querying XML documents in a relational database system, comprising:

means for creating an XML document view;

means for creating relational tables for storing XML documents using relational schema;

means for shredding said XML documents and storing said XML documents as rows in said relational tables according to said relational schema;

means for generating a reconstruction view over said relational tables to define how said shredded XML documents are to be virtually reconstructed; and

means for processing queries over said stored XML documents as queries over said reconstruction view.