Streaming XPath algorithm for XPath expressions with predicates

• US 20070198479A1
• Filed: 02/16/2006
• Published: 08/23/2007
• Est. Priority Date: 02/16/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lin, Fen-Ling, Zhang, Guogen, Cai, Mengchu, Zou, Qinghua, Cu, Jason
• Application Number:
  US11/356,366
• Publication Number:
  US 20070198479A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/8373 Query execution

Abstract

A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

Claims

1. A method for evaluating a path query, the path query corresponding to a query tree including a plurality of query nodes, at least one query node of the plurality of query nodes corresponding to at least one predicate and having a level, the at least one predicate being for at least one previous query node, the method comprising:

scanning a plurality of data nodes of a document to provide a data tree;

determining if the plurality of data nodes matches the plurality of query nodes;

placing data related to the data node in match stacks corresponding to matched query nodes, the data for the at least one query node including at least one attribute corresponding to the at least one predicate; and

propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

2. The method of claim 1 wherein the plurality of query nodes includes a root query node, the plurality of query nodes are related by branches of the query tree, and wherein the determining further includes:

traversing the data tree from the root node along a first portion of the plurality of branches.

3. The method of claim 2 wherein the propagating further includes:

traversing the tree along a second portion of the plurality branches toward the root data node or sideways.

4. The method of claim 1 further comprising:

skipping descendants of a data node if a data node does not match a corresponding query node.

5. The method of claim 2 wherein the query tree including a plurality of leaves corresponding to a portion of the plurality of query nodes, the method further comprising:

providing an output corresponding to at least one leaf of the plurality of leaves if the at least one leaf corresponds to at least one matched query node.

6. The method of claim 1 wherein the placing further includes:

storing at least one variable corresponding to the at least one predicate for the at least one previous query node; and

providing the at least one value for the at least one variable when the at least one node is traversed.

7. The method of claim 6 wherein the propagating further includes:

dropping the at least one previous node for each of the at least one value indicating that the at least one predicate is not fulfilled.

8. The method of claim 1 wherein the plurality of query nodes have child or descendant relationships.

16. The computer-readable medium of claim 1 wherein the plurality of query nodes have child or descendant relationships.

9. A computer-readable medium containing a program for evaluating a path query, the path query corresponding to a query tree including a plurality of query nodes, at least one query node of the plurality of query nodes corresponding to at least one predicate and having a level, the at least one predicate being for at least one previous query node, the program including instructions for:

scanning a plurality of data nodes of a document to provide a data tree;

determining if the plurality of data nodes matches the plurality of query nodes;

placing data related to the data node in match stacks corresponding to matched query nodes, the data for the at least one query node including at least one attribute corresponding to the at least one predicate; and

propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

10. The computer-readable medium of claim 9 wherein the plurality of query nodes includes a root query node, the plurality of query nodes are related by branches of the query tree, and wherein the determining instructions further includes instructions for:

traversing the data tree from the root query node along a first portion of the plurality of branches.

11. The computer-readable medium of claim 10 wherein the propagating instructions further includes instructions for:

traversing the tree along a second portion of the plurality branches toward the root data node or sideways.

12. The computer-readable medium of claim 9 wherein the program further includes instructions for:

skipping descendants of a data node if a data node does not match a corresponding query node.

13. The computer-readable medium of claim 10 wherein the query tree including a plurality of leaves corresponding to a portion of the plurality of query nodes, the program further including instructions for:

providing an output corresponding to at least one leaf of the plurality of leaves if the at least one leaf corresponds to at least one matched query node.

14. The computer-readable medium of claim 9 wherein the placing instructions further includes instructions for:

storing at least one variable corresponding to the at least one predicate for the at least one previous query node; and

providing the at least one value for the at least one variable when the at least one node is traversed.

15. The computer-readable medium of claim 14 wherein the propagating instructions further includes instructions for:

dropping the at least one previous node for each of the at least one value indicating that the at least one predicate is not fulfilled.

17. A system for evaluating a query, the system comprising:

a query tree including a plurality of query nodes, at least one query node of the plurality of query nodes corresponding at least one predicate and having a level, the at least one predicate being evaluated for at least one previous query node, the query tree for using determining if a plurality of data nodes of a data tree corresponding to a scanned document matches the plurality of query nodes, and a matching of the at least one query node to be propagated backward to a matching of the at least one previous query node; and

a plurality of matched stacks for storing data related to the data node in match stacks corresponding to matched query nodes, the data for the at least one query node including at least one attribute corresponding to the at least one predicate.

18. The system of claim 17 wherein the plurality of query nodes have child or descendant relationships.