Improving the Relational Evaluation of XML Queries by Means of Path Summaries

  • Sherif Sakr
Conference paper

DOI: 10.1007/978-3-540-88906-9_48

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5326)
Cite this paper as:
Sakr S. (2008) Improving the Relational Evaluation of XML Queries by Means of Path Summaries. In: Fyfe C., Kim D., Lee SY., Yin H. (eds) Intelligent Data Engineering and Automated Learning – IDEAL 2008. IDEAL 2008. Lecture Notes in Computer Science, vol 5326. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sherif Sakr
    • 1
  1. 1.National ICT Australia (NICTA)SydneyAustralia

Personalised recommendations