Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
ACM SIGMOD Record
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A SQL: 1999 code generator for the pathfinder xquery compiler
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A framework for using materialized XPath views in XML query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Hi-index | 0.00 |
XML query languages such as XQuery, XSLT and SQL/XML are mainly dependent on XPath as the search and extraction language. XPath expressions often define complicated navigations which require expensive query processing costs especially when they are executed over large collections of XML documents. In this paper, we describe an approach of exploiting materialized XPath views to improve the efficiency of relational query processing of XML queries. The main contribution of this paper is to show that an intuitive and very cheap Data Guide synopsis of XML path summaries in addition a light-wight tracing of XPath steps can significantly reduce the XML query-evaluation costs in the relational hosts. Our experiments shows that the overhead introduced by the use of path summaries and an additional path identifier of node-based relational encoding of the XML documents is negligible but can result in significant reduction of the processing costs of relational evaluation of XML queries.