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

  • Sherif Sakr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5326)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Balmin, A., Özcan, F., Beyer, K., Cochrane, R., Pirahesh, H.: A Framework for Using Materialized XPath Views in XML Query Processing. In: VLDB (2004)Google Scholar
  2. 2.
    Barta, A., Consens, M., Mendelzon, A.: XML Query Optimization Using Path Indexes.. In: XIME-P (2004)Google Scholar
  3. 3.
    Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD (2002)Google Scholar
  4. 4.
    Eisenberg, A., Melton, J.: Advancements in SQL/XML. SIGMOD Record 33(3) (2004)Google Scholar
  5. 5.
    Goldman, R., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases.. In: VLDB (1997)Google Scholar
  6. 6.
    Graefe, G.: Sorting And Indexing With Partitioned B-Trees.. In: CIDR (2003)Google Scholar
  7. 7.
    Grust, T.: Purely Relational FLWORs. In: XIME-P (2005)Google Scholar
  8. 8.
    Grust, T., Keulen, M., Teubner, J.: Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps.. In: VLDB (2003)Google Scholar
  9. 9.
    Grust, T., Mayr, M., Rittinger, J., Sakr, S., Teubner, J.: A SQL:1999 Code Generator for the Pathfinder XQuery Compiler. In: SIGMOD (2007)Google Scholar
  10. 10.
    Grust, T., Sakr, S., Teubner, J.: XQuery on SQL Hosts. In: VLDB (2004)Google Scholar
  11. 11.
    Grust, T., Teubner, J.: Relational Algebra: Mother Tongue – XQuery: Fluent. In: Twente Data Management Workshop (TDM) (2004)Google Scholar
  12. 12.
    Grust, T.: Accelerating XPath location steps.. In: SIGMOD (2002)Google Scholar
  13. 13.
    Jiang, H., Lu, H., Wang, W., Xu Yu, J.: XParent: An Efficient RDBMS-Based XML Database System. In: ICDE (2002)Google Scholar
  14. 14.
    Marian, A., Siméon, J.: Projecting XML Documents.. In: VLDB (2003)Google Scholar
  15. 15.
    Schmidt, A., Waas, F., Kersten, M., Carey, M., Manolescu, I., Busse, R.: XMark: A Benchmark for XML Data Management. In: VLDB (2002)Google Scholar
  16. 16.
    Wu, Y., Patel, J., Jagadish, H.V.: Structural Join Order Selection for XML Query Optimization.. In: ICDE (2003)Google Scholar
  17. 17.
    Xu, W., Meral, Z.: Rewriting XPath queries using materialized views. In: VLDB (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

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

Personalised recommendations