Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
Nested Queries and Quantifiers in an Ordered Context
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Full-Fledged Algebraic XPath Processing in Natix
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Forward node-selecting queries over trees
ACM Transactions on Database Systems (TODS)
Taming XPath queries by minimizing wildcard steps
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient physical operators for cost-based XPath execution
Proceedings of the 13th International Conference on Extending Database Technology
Optimizing sorting and duplicate elimination in XQuery path expressions
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Index vs. navigation in XPath evaluation
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
| Hi-index | 0.00 |
We propose a new approach for the efficient evaluationof XPath expressions. This is important, since XPath is notonly used as a simple, stand-alone query language, but isalso an essential ingredient of XQuery and XSLT.The main idea of our approach is to translate XPath intoalgebraic expressions parameterized with programs. Theseprograms are mainly built from navigational primitives likeaccessing the first child or the next sibling. The goals ofthe approach are 1) to enable pipelined evaluation, 2) toavoid producing duplicate (intermediate) result nodes, 3) tovisit as few document nodes as possible, and 4) to avoidvisiting nodes more than once. This improves the existingapproaches, because our method is highly efficient.