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

The complexity of reasoning about pattern-based XML schemas

Published:11 June 2007Publication History

ABSTRACT

In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form (r,s), wherer, s are regular expressions. Sets of such rules can be interpreted in an existential or a universal fashion. An XML tree is existentially valid with respect to a rule set, if for each node there is a rule such that the root path of the node matches r and the children sequence of the node matchess. It is universally valid if each node matching r also matchess. This paper investigates the complexity of reasoning about such rule sets, in particular the satisfiability and the implication problem. Whereas, in general these reasoning problems are complete for EXPTIME, two important fragments are identified with PSPACE and PTIME complexity, respectively.

References

  1. M. Arenas and L. Libkin. A normal form for XML documents. ACM Trans. on Database Systems, 291):195--232, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Arenas and L. Libkin. Xml data exchange: Consistency and query answering. In PODS 05, pages 13--24, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. J. Bex, W. Martens, F. Neven, and T. Schwentick. Expressiveness of XSDs: from practice to theory, there and back again. WWW 05, pages 712--721, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular Tree and Regular Hedge Languages over Unranked Alphabets. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, Version 1, 3. April 2001.Google ScholarGoogle Scholar
  5. A. Brüggemann-Klein and D. Wood. One-Unambiguous Regular Languages. Information and Computation, 142(2):182--206, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. B. S. Chlebus. Domino-Tiling Games. Journal of Computer and System Sciences, 32(3):374--392, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata, 1997.Google ScholarGoogle Scholar
  8. World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML.Google ScholarGoogle Scholar
  9. J. Cristau, C. Löding, and W. Thomas. Deterministic Automata on Unranked Trees. In FCT 05, pages 68--79, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. Martens, F. Neven, and T. Schwentick. Complexity of Decision Problems for Simple Regular Expressions. MFCS 04, pages 889--900, 2004.Google ScholarGoogle Scholar
  11. W. Martens, F. Neven, and T. Schwentick. Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 05, pages 68--82, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Marx. XPath with conditional axis relations. In EDBT 04, 2004.Google ScholarGoogle Scholar
  13. M. Murata, D. Lee, and M. Mani. Taxonomy of XML Schema Languages using Formal Language Theory. Extreme Markup Languages, Montreal, Canada, 2001.Google ScholarGoogle Scholar
  14. F. Neven. Automata, Logic, and XML. CSL 02, pages 2--26, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in COmputer Science, 2(3), 2006.Google ScholarGoogle Scholar
  16. T. Schwentick. Automata for XML - A Survey. Journal of Computer an System Sciences, 73(3):289--315, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The complexity of reasoning about pattern-based XML schemas

    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!