The complexity of reasoning about pattern-based XML schemas

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 155-164

  Kasneci, Gjergji ^a   Schwentick, Thomas ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Integrity constraints; XML schemas

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

INTEGRITY CONSTRAINTS; XML SCHEMAS;

XML;

EID: 35448937638     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265552     Document Type: Conference Paper

References (16)

1. M. Arenas and L. Libkin. A normal form for XML documents. ACM Trans. on Database Systems, 29(1):195-232, 2004.
2. M. Arenas and L. Libkin. Xml data exchange: Consistency and query answering. In PODS 05, pages 13-24, 2005.
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.
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.
5. A. Brüggemann-Klein and D. Wood. One-Unambiguous Regular Languages. Information and Computation, 142(2): 182-206, 1998.
6. B. S. Chlebus. Domino-Tiling Games. Journal of Computer and System Sciences, 32(3):374-392, 1986.
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.
8. World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML.
9. J. Cristau, C. Löding, and W. Thomas. Deterministic Automata on Unranked Trees. In FCT 05, pages 68-79, 2005.
10. W. Martens, F. Neven, and T. Schwentick. Complexity of Decision Problems for Simple Regular Expressions. MFCS 04, pages 889-900, 2004.
11. W. Martens, F. Neven, and T. Schwentick. Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 05, pages 68-82, 2005.
12. M. Marx. XPath with conditional axis relations. In EDBT 04, 2004.
13. M. Murata, D. Lee, and M. Mani. Taxonomy of XML Schema Languages using Formal Language Theory. Extreme Markup Languages, Montreal, Canada, 2001.
14. F. Neven. Automata, Logic, and XML. CSL 02, pages 2-26, 2002.
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.
16. T. Schwentick. Automata for XML - A Survey. Journal of Computer an System Sciences, 73(3):289-315, 2007.