Refining the Taxonomy of XML Schema Languages. A new Approach for Categorizing XML Schema Languages in Terms of Processing Complexity

This paper presents a refined taxonomy of XML schema languages based on the work by Murata et al., 2005. It can be seen as first building block for a more elaborate formal analysis of XML and its accompanied specifications, in this case: XML schema languages such as DTD, XSD and RELAX NG.

[1]  Yannis Papakonstantinou,et al.  DTD inference for views of XML data , 2000, PODS.

[2]  Derick Wood,et al.  One-Unambiguous Regular Languages , 1998, Inf. Comput..

[3]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

[4]  Noman Zahid,et al.  A Comparative Analysis of XML Schema Languages , 2009, FGIT-DTA.

[5]  Murali Mani,et al.  Taxonomy of XML schema languages using formal language theory , 2005, TOIT.

[6]  Fabio Vitali,et al.  DTD++ 2.0: Adding support for co-constraints , 2004, Extreme Markup Languages®.

[7]  Dongwon Lee,et al.  XML to Relational Conversion Using Theory of Regular Tree Grammars , 2003, EEXTT.

[8]  Frank Neven,et al.  Optimizing Schema Languages for XML: Numerical Constraints and Interleaving , 2009, SIAM J. Comput..

[9]  Derick Wood,et al.  The parsing of extended context-free grammars , 2002 .

[10]  Romeo Rizzi.  Complexity of Context-Free Grammars with Exceptions and the Inadequacy of Grammars as Models for XML and SGML , 2001, Markup Lang..

[11]  Fabio Vitali,et al.  Datatype- and namespace-aware DTDs: A minimal extension , 2003, Extreme Markup Languages®.

[12]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[13]  Dongwon Lee,et al.  Comparative analysis of six XML schema languages , 2000, SGMD.

[14]  Thomas Schwentick,et al.  Which XML Schemas Admit 1-Pass Preorder Typing? , 2005, ICDT.

[15]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[16]  Noam Chomsky,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[17]  Derick Wood,et al.  Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata , 2004, Extreme Markup Languages®.

[18]  William F. Ogden,et al.  A helpful result for proving inherent ambiguity , 1968, Mathematical systems theory.

[19]  Thomas Schwentick,et al.  Expressiveness and complexity of XML Schema , 2006, TODS.

[20]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[21]  Thomas Schwentick,et al.  Simple off the shelf abstractions for XML schema , 2007, SGMD.

[22]  Derick Wood,et al.  Deterministic Regular Languages , 1991, STACS.

[23]  C. M. Sperberg-McQueen,et al.  GODDAG: A Data Structure for Overlapping Hierarchies , 2000, DDEP/PODDP.

[24]  James Rogers,et al.  Syntactic Structures as Multi-dimensional Trees , 2003 .

[25]  Noam Chomsky.  Logical Syntax and Semantics: Their Linguistic Relevance , 1955 .

[26]  C. M. Sperberg-McQueen.  Logic grammars and XML Schema , 2003, Extreme Markup Languages®.

[27]  Eric van der Vlist,et al.  Relax NG , 2003 .

[28]  Frank Neven,et al.  Simplifying XML schema: effortless handling of nondeterministic regular expressions , 2009, SIGMOD Conference.

[29]  Pekka Kilpeläinen,et al.  One-unambiguity of regular expressions with numeric occurrence indicators , 2007, Inf. Comput..

[30]  Eve Maler,et al.  Developing SGML DTDs: From Text to Model to Markup , 1995 .

[31]  Charles F. Goldfarb,et al.  SGML handbook , 1990 .

[32]  Thomas Schwentick,et al.  Complexity of Decision Problems for XML Schemas and Chain Regular Expressions , 2009, SIAM J. Comput..

[33]  Yves Marcoux.  Graph characterization of overlap-only TexMECS and other overlapping markup formalisms , 2008 .

[34]  Thomas Schwentick,et al.  XML: Model, Schemas, Types, Logics, and Queries , 2003, Logics for Emerging Applications of Databases.

[35]  Yannis Papakonstantinou,et al.  Incremental validation of XML documents , 2003, TODS.

[36]  Wendell Piez.  Beyond the "descriptive vs. procedural" distinction , 2001, Extreme Markup Languages®.