Lore: a database management system for semistructured data
ACM SIGMOD Record
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Hi-index | 0.00 |
We describe the design and preliminary analysis of an optimization technique for XPath called warp-edge optimization. The XPath data model is a tree-like data model that has an edge from an element to each component in the content of that element. The edges are traversed in the evaluation of an XPath expression. A warp edge is an edge that is something other than a parent to child edge, i.e., an edge from an element to a sibling or to a grandchild. Warp edges can be dynamically generated and stored during query evaluation to improve the efficiency of future queries. We describe the implementation of warpedge optimization as a layer on top of Xalan, the XPath evaluation engine from Apache. Experiments demonstrate that in the evaluation of some XPath expressions, the use of warp edges results in substantial savings of time.