Advertisement

Abstract

The creation, maintenance and disposal of tree fragments during XQuery execution form a significant issue in the design of XQuery processors. The problem is further complicated by the definition of node identity which violates the functional nature of the XQuery language. This paper presents a novel mathematical model of XQuery execution that reflects temporary tree construction and manipulation, including navigation. Using this model as reference, an efficient algorithm of static analysis is presented that determines the level of information required at a particular place of the XQuery program. As a side effect, the algorithm also decides on the ordered/unordered context as defined by the XQuery language. Based on this algorithm, the amount of information stored during the execution as well as the complexity of operations may be significantly reduced.

Keywords

Relational Algebra Tree Environment Canonical Model Large Data Base XPath Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boncz, P., Grust, T., van Keulen, M., Manegold, S., Rittinger, J., Teubner, J.: Pathfinder: XQuery—The Relational Way. In: Böhm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.-Å., Ooi, B.C. (eds.) VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 1322–1325. ACM, New York (2005)Google Scholar
  2. 2.
    Chamberlin, D.: XQuery: Where Do We Go from Here? In: XIMEP 2006, 3rd International Workshop on XQuery Implementation, Experiences and Perspectives. ACM Digital Library, New York (2006)Google Scholar
  3. 3.
    El-Sayed, M., Wang, L., Ding, L., Rundensteiner, E.A.: An Algebraic Approach for Incremental Maintenance of Materialized XQuery Views. In: WIDM 2002: Proceedings of the 4th International Workshop on Web Information and Data Management, pp. 88–91. ACM, New York (2002)CrossRefGoogle Scholar
  4. 4.
    Fegaras, L., Dash, R., Wang, Y.: A Fully Pipelined XQuery Processor. In: XIMEP 2006, 3rd International Workshop on XQuery Implementation, Experiences and Perspectives. ACM, New York (2006)Google Scholar
  5. 5.
    Fokoue, A., Rose, K., Siméon, J., Villard, L.: Compiling XSLT 2.0 into XQuery 1.0. In: WWW 2005: Proceedings of the 14th International Conference on World Wide Web, pp. 682–691. ACM, New York (2005)CrossRefGoogle Scholar
  6. 6.
    Groppe, S., Böttcher, S., Birkenheuer, G., Höing, A.: Reformulating XPath Queries and XSLT Queries on XSLT Views. Technical report, University of Paderborn (2006)Google Scholar
  7. 7.
    Grust, T., Rittinger, J., Teubner, J.: eXrQuy: Order Indifference in XQuery. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 226–235. IEEE Computer Society, Los Alamitos (2007)CrossRefGoogle Scholar
  8. 8.
    Hidders, J., Michiels, P., Paredaens, J., Vercammen, R.: LixQuery: A Formal Foundation for XQuery Research. SIGMOD Rec. 34(4), 21–26 (2005)CrossRefGoogle Scholar
  9. 9.
    Hloušek, P.: XPath, XQuery, XSLT: Formal Approach. PhD thesis, Charles University Prague (2005)Google Scholar
  10. 10.
    Janssen, W., Korlyukov, A., Van den Bussche, J.: On the Tree-Transformation Power of XSLT. Technical report, University of Hasselt (2006)Google Scholar
  11. 11.
    Lu, J., Ling, T.W., Chan, C.-Y., Chen, T.: From Region Encoding to Extended Dewey: On Efficient Processing of XML Twig Pattern Matching. In: Böhm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.-Å., Ooi, B.C. (eds.) VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 193–204. ACM, New York (2005)Google Scholar
  12. 12.
    Pal, S., Cseri, I., Seeliger, O., Rys, M., Schaller, G., Yu, W., Tomic, D., Baras, A., Berg, B., Churin, D., Kogan, E.: XQuery Implementation in a Relational Database System. In: Böhm, K., Jensen, C.S., Haas, L.M., Kersten, M.L., Larson, P.-Å., Ooi, B.C. (eds.) VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 1175–1186. ACM, New York (2005)Google Scholar
  13. 13.
    Paparizos, S., Wu, Y., Lakshmanan, L.V.S., Jagadish, H.V.: Tree Logical Classes for Efficient Evaluation of XQuery. In: SIGMOD 2004: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 71–82. ACM, New York (2004)CrossRefGoogle Scholar
  14. 14.
    XQuery 1.0 and XPath 2.0 Formal Semantics, W3C (2007)Google Scholar
  15. 15.
    XML Query Test Suite, W3C (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • David Bednárek
    • 1
  1. 1.Department of Software Engineering Faculty of Mathematics and PhysicsCharles University Prague 

Personalised recommendations