skip to main content
article

Forward node-selecting queries over trees

Published:01 March 2007Publication History
Skip Abstract Section

Abstract

Node-selecting queries over trees lie at the core of several important XML languages for the web, such as the node-selection language XPath, the query language XQuery, and the transformation language XSLT. The main syntactic constructs of such queries are the backward predicates, for example, ancestor and preceding, and the forward predicates, for example, descendant and following. Forward predicates are included in the depth-first, left-to-right preorder relation associated with the input tree, whereas backward predicates are included in the inverse of this preorder relation.

This work is devoted to an expressiveness study of node-selecting queries with proven theoretical and practical applicability, especially in the field of query evaluation against XML streams. The main question it answers positively is whether, for each input query with forward and backward predicates, there exists an equivalent forward-only output query. This question is then positively answered for input and output queries of varying structural complexity, using LOGLIN and PSPACE reductions.

Various existing applications based on the results of this work are reported, including query optimization and streamed evaluation.

References

  1. Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Altinel, M. and Franklin, M. J. 2000. Efficient filtering of XML documents for selective dissemination of information. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 53--64. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Amer-Yahia, S., Cho, S., Lakshmanan, L. V. S., and Srivastava, D. 2002. Tree pattern query minimization. VLDB J. 11, 4, 315--331. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Apache Project. 2001a. Cocoon 2.0: XML publishing framework. http://xml.apache.org/cocoon/index.html.Google ScholarGoogle Scholar
  5. Apache Project. 2001b. Xalan-Java, version 2.2. http://xml.apache.org/xalan-j/index.html.Google ScholarGoogle Scholar
  6. Baader, F. and Nipkow, T. 1998. Term Rewriting and All That. Cambridge University Press, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Barton, C., Charles, P., Goyal, D., Raghavachari, M., Fontoura, M., and Josifovski, V. 2003. Streaming XPath processing with forward and backward axes. In Proceedings of the International Conference on Data Engineering (ICDE). 455--466.Google ScholarGoogle Scholar
  8. Benedikt, M., Fan, W., and Kuper, G. M. 2005. Structural properties of XPath fragments. Theor. Comput. Sci. 336, 1, 3--31. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Boag, S., Chamberlin, D., Fernandez, M. F., Florescu, D., Robie, J., and Siméon, J. 2006. XQuery 1.0: An XML query language. Candidate recommendation, World Wide Web Consortium.Google ScholarGoogle Scholar
  10. Bry, F., Coskun, F., Durmaz, S., Furche, T., Olteanu, D., and Spannagel, M. 2005. The XML stream query processor SPEX (demo). In Proceedings of the International Conference on Data Engineering (ICDE). http://spex.sourceforge.net. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Bry, F. and Kröger, P. 2003. A computational biology database digest: Data, data analysis, and data management. Distrib. Parallel Databases 13, 1, 7--42. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Chan, C.-Y., Felber, P., Garofalakis, M. N., and Rastogi, R. 2002. Efficient filtering of XML documents with XPath expressions. In Proceedings of the International Conference on Data Engineering (ICDE) 235--244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Clark, J. 1999. XSL Transformations (XSLT) version 1.0. W3C recommendation, World Wide Web Consortium.Google ScholarGoogle Scholar
  14. Clark, J. and DeRose, S. 1999. XML path language (XPath) version 1.0. W3C recommendation, World Wide Web Consortium.Google ScholarGoogle Scholar
  15. DeRose, S., Jr., R. D., Grosso, P., Maler, E., Marsh, J., and Walsh, N. 2002. XML pointer language (XPointer). W3C recommendation, World Wide Web Consortium. http://www.w3.org/TR/xptr/.Google ScholarGoogle Scholar
  16. Desai, A. 2001. Introduction to sequential XPath. In Proceedings of the IDEAlliance XML Conference.Google ScholarGoogle Scholar
  17. Fallside, D. C. and Walmsley, P. 2001. XML-Schema. W3C recommendation, World Wide Web Consortium. http://www.w3.org/XML/Schema.Google ScholarGoogle Scholar
  18. Flesca, S., Furfaro, F., and Masciari, E. 2003. On the minimization of XPath queries. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 153--164. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Gottlob, G., Koch, C., and Pichler, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 95--106. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Gottlob, G. and Koch, C. 2004. Monadic datalog and the expressive power of languages for web information extraction. J. ACM, 51, 1, 74--113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Gottlob, G., Koch, C., and Schulz, K. 2006. Conjunctive queries over trees. J. ACM 53, 2. to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Grust, T., van Keulen, M., and Teubner, J. 2004. Accelerating XPath evaluation in any RDBMS. ACM Trans. Database Syst. 29, 91--131. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Helmer, S., Kanne, C.-C., and Moerkotte, G. 2002. Optimized translation of XPath into algebraic expressions parameterized by programs containing navigational primitives. In Proceedings of the International Conference on Web Information Systems Engineering (WISE). 215--224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Hidders, J. and Michiels, P. 2003. Avoiding unnecessary ordering operations in XPath. In Proceedings of the International Conference on Data Base Programming Languages (DBPL). 54--70.Google ScholarGoogle Scholar
  25. Ide, N., Bonhomme, P., and Romary, L. 2000. XCES: An XML-Based standard for linguistic corpora. In Proceedings of the Annual Conference on Language Resources and Evaluation (LREC) 825--830.Google ScholarGoogle Scholar
  26. Ives, Z. G., Halevy, A. Y., and Weld, D. S. 2002. An XML query engine for network-bound data. VLDB J. 11, 4, 380--402. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Kay, M. 2004. XSL Transformations (XSLT), version 2.0. Working draft, World Wide Web Consortium.Google ScholarGoogle Scholar
  28. Lincoln, P. and Christian, J. 1989. Adventures in associative-commutative unification. J. Symbol. Comput. 8, 1--2, 217--240. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Marian, A. and Siméon, J. 2003. Projecting XML documents. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 213--224. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Marx, M. 2005. Conditional XPath. ACM Trans. Database Syst. to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. NASA. 2004. XML group resources page. http://xml.gsfc.nasa.gov/.Google ScholarGoogle Scholar
  32. Newman, M. H. A. 1942. On theories with a combinatorial definition of ‘equivalence’. Ann. Math. 43, 2, 223--243.Google ScholarGoogle ScholarCross RefCross Ref
  33. Olteanu, D. 2004. Evaluation of XPath queries against XML streams. Ph.D. thesis, University of Munich.Google ScholarGoogle Scholar
  34. Olteanu, D., Furche, T., and Bry, F. 2004. Evaluating complex queries against XML streams with polynomial combined complexity. In Proceedings of the Annual British National Conference on Databases (BNCOD). 31--44.Google ScholarGoogle Scholar
  35. Olteanu, D., Meuss, H., Furche, T., and Bry, F. 2002. XPath: Looking forward. In Proceedings of the EDBT Workshop XMLDM. 109--127. Lecture Notes in Computer Science vol. 2490. Springer Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Popa, L., Deutsch, A., and Tannen, V. 1999. Physical data independence, constraints, and optimization with universal plans. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 459--470. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Raghavan, V., Deschler, K., and Rundensteiner, E. A. 2005. Vamana: A scalable cost-driven XPath engine. In International Workshop on XML Schema and Data Management (XSDM).Google ScholarGoogle Scholar
  38. Schott, S. and Noga, M. L. 2003. Lazy XSL transformations. In Proceedings of the ACM Symposium on Document Engineering. 9--18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Wood, P. T. 2001. Minimizing simple XPath expressions. In Proceedings of the International Workshop on Web and Databases (WebDB). 13--18.Google ScholarGoogle Scholar

Index Terms

  1. Forward node-selecting queries over trees

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Database Systems
          ACM Transactions on Database Systems  Volume 32, Issue 1
          March 2007
          279 pages
          ISSN:0362-5915
          EISSN:1557-4644
          DOI:10.1145/1206049
          Issue’s Table of Contents

          Copyright © 2007 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 March 2007
          Published in tods Volume 32, Issue 1

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader