One-unambiguous regular languages
Information and Computation
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparative analysis of six XML schema languages
ACM SIGMOD Record
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automated Software Engineering
Automata theory for XML researchers
ACM SIGMOD Record
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Everything You Ever Wanted to Know About DTDs, But Were Afraid to Ask (Extended Abstract)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
ACM SIGMOD Record
Schemapath, a minimal extension to xml schema for conditional constraints
Proceedings of the 13th international conference on World Wide Web
DTDs versus XML schema: a practical study
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
XML for Bioinformatics
XML Schema
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Journal of Computer and System Sciences
The complexity of reasoning about pattern-based XML schemas
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
XML representation of metabolic P systems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Structural patterns for descriptive documents
ICWE'07 Proceedings of the 7th international conference on Web engineering
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Proceedings of the 20th ACM international conference on Information and knowledge management
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an investigation of the XML Schema Definitions (XSDs) occurring in practice reveals that the vast majority of them are structurally equivalent to DTDs. This might be due to the complexity of the XML Schema specification and the difficulty to understand the effect of constraints on typing and validation of schemas. To shed some light on the actual expressive power of XSDs this paper studies the impact of the Element Declarations Consistent (EDC) and the Unique Particle Attribution (UPA) rule. An equivalent formalism based on contextual patterns rather than on recursive types is proposed which might serve as a light-weight front end for XML Schema. Finally, the effect of EDC and UPA on the way XML documents can be typed is discussed. It is argued that a cleaner, more robust, stronger but equally efficient class is obtained by replacing EDC and UPA with the notion of 1-pass preorder typing: schemas that allow to determine the type of an element of a streaming document when its opening tag is met. This notion can be defined in terms of restrained competition regular expressions and there is again an equivalent syntactical formalism based on contextual patterns.