skip to main content
10.1145/1559795.1559827acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Satisfiability of downward XPath with data equality tests

Published:29 June 2009Publication History

ABSTRACT

In this work we investigate the satisfiability problem for the logic XPath(↓*, ↓,=), that includes all downward axes as well as equality and inequality tests. We address this problem in the absence of DTDs and the sibling axis. We prove that this fragment is decidable, and we nail down its complexity, showing the problem to be ExpTime-complete. The result also holds when path expressions allow closure under the Kleene star operator. To obtain these results, we introduce a new automaton model over data trees that captures XPath(↓*, ↓,=) and has an ExpTime emptiness problem. Furthermore, we give the exact complexity of several downward-looking fragments.

References

  1. M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. J.ACM, 55(2), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. In PODS, pages 10--19. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. S. Chlebus. Domino-tiling games. J. Comput. Syst. Sci., 32(3):374--392, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Clark and S. DeRose. XML path language (XPath). Website, November 1999. W3C Recommendation. http://www.w3.org/TR/xpath.Google ScholarGoogle Scholar
  5. F. Geerts and W. Fan. Satisfiability of XPath queries with sibling axes. In DBPL, volume 3774, pages 122--137. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Trans. Database Syst., 30(2):444--491, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Jurdzinski and R. Lazić. Alternating automata on data trees and XPath satisfiability. CoRR, abs/0805.0330, 2008.Google ScholarGoogle Scholar
  8. M. Marx. First order paths in ordered trees. In ICDT, volume 3363, pages 114--128. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. B. ten Cate. The expressivity of XPath with transitive closure. In PODS, pages 328--337. ACM Press, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. B. ten Cate and L. Segoufin. XPath, transitive closure logic, and nested tree walking automata. In PODS, pages 251--260. ACM Press, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Satisfiability of downward XPath with data equality tests

        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 '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2009
          298 pages
          ISBN:9781605585536
          DOI:10.1145/1559795
          • General Chair:
          • Jan Paredaens,
          • Program Chair:
          • Jianwen Su

          Copyright © 2009 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 June 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-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!