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.
- M. Arenas and L. Libkin. A normal form for XML documents. ACM Trans. on Database Systems, 291):195--232, 2004. Google Scholar
Digital Library
- M. Arenas and L. Libkin. Xml data exchange: Consistency and query answering. In PODS 05, pages 13--24, 2005. Google Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
- A. Brüggemann-Klein and D. Wood. One-Unambiguous Regular Languages. Information and Computation, 142(2):182--206, 1998. Google Scholar
Digital Library
- B. S. Chlebus. Domino-Tiling Games. Journal of Computer and System Sciences, 32(3):374--392, 1986. Google Scholar
Digital Library
- 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 Scholar
- World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML.Google Scholar
- J. Cristau, C. Löding, and W. Thomas. Deterministic Automata on Unranked Trees. In FCT 05, pages 68--79, 2005. Google Scholar
Digital Library
- W. Martens, F. Neven, and T. Schwentick. Complexity of Decision Problems for Simple Regular Expressions. MFCS 04, pages 889--900, 2004.Google Scholar
- W. Martens, F. Neven, and T. Schwentick. Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 05, pages 68--82, 2005. Google Scholar
Digital Library
- M. Marx. XPath with conditional axis relations. In EDBT 04, 2004.Google Scholar
- M. Murata, D. Lee, and M. Mani. Taxonomy of XML Schema Languages using Formal Language Theory. Extreme Markup Languages, Montreal, Canada, 2001.Google Scholar
- F. Neven. Automata, Logic, and XML. CSL 02, pages 2--26, 2002. Google Scholar
Digital Library
- 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 Scholar
- T. Schwentick. Automata for XML - A Survey. Journal of Computer an System Sciences, 73(3):289--315, 2007. Google Scholar
Digital Library
Index Terms
The complexity of reasoning about pattern-based XML schemas
Recommendations
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem of extended chain regular expressions (eCHAREs). These are regular expressions with a very simple structure: they basically consist of the concatenation of factors, where ...
Schema extraction from XML collections
JCDL '02: Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital librariesXML Schema language has been proposed to replace Document Type Definitions (DTDs) as schema mechanism for XML data. This language consistently extends grammar-based constructions with constraint- and pattern-based ones and have a higher expressive power ...
A Conceptual Schema Based XML Schema with Integrity Constraints Checking
ICHIT '08: Proceedings of the 2008 International Conference on Convergence and Hybrid Information TechnologyThe more popular XML for exchanging and representing information on Web, the more important Flat XML (XML) and intelligent editors become. For data exchanging, an XML Data with an XML Schema and integrity constraints are preferred. We employ an Object-...






Comments