skip to main content
10.1145/1265530.1265559acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article

Polynomial time fragments of XPath with variables

Published:11 June 2007Publication History

ABSTRACT

Variables are the distinguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO) queries modulo linear time transformations. In this paper, we distinguish a fragment of Core XPath 2.0 that remains FO-complete with respect ton-ary queries while enjoying polynomial-time query answering.

References

  1. N. Alechina, S. Demri, and M. de Rijke. A modal perspective on path constraints. Journal of Logic and Computation, 13(6):939--956, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  2. Marcelo Arenas, Pablo Barcelo, and Leonid Libkin. Combining temporal logics for querying XML documents. In International Conference on Database Theory, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Guillaume Bagan. MSO queries on tree decomposable structures are computable with linear delay. In CSL, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Pablo Barcelo and Leonid Libkin. Temporal logics over unranked trees. In LICS, pages 31--40. 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Michael Benedikt and Christoph Koch. XPath leashed. 2006. submitted.Google ScholarGoogle Scholar
  6. Patrick Blackburn and Jerry Seligman. Hybrid languages. Journal of Logic, Language and Information, 4(3):251--272, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. ACM conference on Theory of computing, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Bruno Courcelle. Linear delay enumeration and monadic second-order logic. 2006. submitted.Google ScholarGoogle Scholar
  9. Arnaud Durand and Etienne Grandjean. The Complexity of Acyclic Conjunctive Queries Revisited. 2004.Google ScholarGoogle Scholar
  10. Arnaud Durand and Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Transactions on Computational Logics, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Ebbinghaus and J. Flum. Finite Model Theory. Springer Verlag, Berlin, 1999.Google ScholarGoogle Scholar
  12. M. Franceschet and E. Zimuel. Modal logic and navigational xpath: an experimental comparison. In Proceedings of Workshop Methods for Modalities, pages 156--172, 2005.Google ScholarGoogle Scholar
  13. Georg Gottlob, Christoph Koch, and Reinhard Pichler. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444--491, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Leonid Libkin. Logics over unranked trees: an overview. Logical Methods in Computer Science, 32):1--31, 2006.Google ScholarGoogle Scholar
  15. Maarten Marx. Conditional XPath. ACM Transactions on Database Systems, 30(4):929--959, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Maarten Marx. First order paths in ordered trees. In International Conference on Database Theory, pages 114--128, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. F. Moller and A. Rabinovich. Counting on CTL: on the expressive power of monadic path logic. Information and Computation, 184(1):147--159, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Frank Neven and Thomas Schwentick. Query automata over finite trees. TCS, 275(1-2):633--674, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Thomas Schwentick. On diving in trees. In MFCS, pages 660--669, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379--419, 1975.Google ScholarGoogle ScholarCross RefCross Ref
  21. L. J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.Google ScholarGoogle Scholar
  22. Balder ten Cate and Maarten Marx. Axiomatizing the logical core of XPath 2.0. In ICDT, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Wolfgang Thomas. Logical aspects in the study of tree languages. In 9th International Colloquium on Trees in Algebra and Programming, pages 31--50, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proceeding of VLDB, pages 82--94, 1981.Google ScholarGoogle Scholar

Index Terms

  1. Polynomial time fragments of XPath with variables

            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
            • Published in

              cover image ACM Conferences
              PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
              June 2007
              328 pages
              ISBN:9781595936851
              DOI:10.1145/1265530

              Copyright © 2007 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 11 June 2007

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate476of1,835submissions,26%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!