Semantic aware processing of XML documents

• US 20080033967A1
• Filed: 07/18/2006
• Published: 02/07/2008
• Est. Priority Date: 07/18/2006
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Murthy, Ravi
• Application Number:
  US11/489,426
• Publication Number:
  US 20080033967A1
• Time in Patent Office: Days
• US Class Current: 707/100
• 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

Abstract

Semantic aware processing of XML documents treats elements that have different names but that are semantically equivalent as being the same element when performing operations that depend on element names, such as querying and schema validation. The semantic aware processing is based on a mapping that maps each element name of a set of semantically equivalent names to a “canonical tag name”.

Claims

1. A method, comprising the computer-implemented steps of:

storing a semantic mapping that maps a canonical tag-name to both a first name of a first node and to a second name of a second node, different than said first name, wherein a collection of XML documents includes said first node and said second node; and

based on the semantic mapping, performing a tag name operation by treating said first name and second name as identical names.

2. The method of claim 1, wherein the tag name operation is computation of a query issued against said collection of XML documents.

3. The method of claim 1, wherein the tag name operation includes a schema validation.

4. The method of claim 1, wherein said tag name operation is performed by a repository that manages access to said collection of XML documents.

5. The method of claim 4, wherein the computer-implemented steps further include:

receiving a request to register data representing said semantic mapping; and

in response to said request, registering said data as said semantic mapping.

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 1.

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 2.

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 3.

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 4.

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 5.

20. The computer-readable medium of claim 10, wherein:

the semantic pathid for said each node includes a code for each name of a node in the path of said each node; and

the respective code for the first name and the second name are the same.

6. A method, comprising the computer-implemented steps of:

for each node of a plurality of nodes in a collection of XML documents, generating a semantic pathid based on a semantic mapping;

wherein the plurality of nodes include a first node and a second node;

wherein a first name is associated with the first node or an ascendant node of said first node;

wherein a second name is associated with the second node or an ascendant of said second node;

wherein the semantic mapping maps a canonical tag-name to said first name and to said second name;

wherein the semantic pathid generated for said first node and said second node are identical.

7. The method of claim 6, wherein:

the semantic pathid for said each node includes a code for each name of a node in the path of said each node; and

the code for the first name and the code for the second name are the same.

8. The method of claim 6, the computer-implemented steps further including:

creating an index that indexes said plurality of nodes by the semantic pathids generated for said plurality of nodes.

9. The method of claim 6, wherein said collection of XML documents is managed by a database server, the computer-implemented steps further comprising:

receiving a query issued against the collection of XML documents, said query specifying a path; and

based on said path, a database server rewriting said query to access said index.

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 6.

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 7.

17. 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.

18. 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 9.

19. A computer-readable medium storing an index of a plurality of nodes in a collection of XML documents, wherein:

each node of said plurality of nodes is associated with a certain path that includes said each node;

each entry of said index corresponds to a particular node of said plurality of nodes and associates said node with a semantic pathid representing the certain path of said particular node;

the plurality of nodes include a first node and a second node;

a first name is associated with the first node or an ascendant node of said first node;

a second name is associated with the second node or an ascendant node of said second node; and

the respective semantic pathids for said first node and said second node are identical.