One-unambiguous regular languages
Information and Computation
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Disambiguation of SGML Content Models
PODP '96 Proceedings of the Third International Workshop on Principles of Document Processing
Answering XML Queries on Heterogeneous Data Sources
Proceedings of the 27th International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
WWW '03 Proceedings of the 12th 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
On validation of XML streams using finite state machines
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
XML Schema
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Query optimization in XML structured-document databases
The VLDB Journal — The International Journal on Very Large Data Bases
Inference of concise DTDs from XML data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
ShreX: managing XML documents in relational databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Inferring XML schema definitions from XML data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Learning deterministic regular expressions for the inference of schemas from XML data
Proceedings of the 17th international conference on World Wide Web
SchemaScope: a system for inferring and cleaning XML schemas
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Linear time membership in a class of regular expressions with interleaving and counting
Proceedings of the 17th ACM conference on Information and knowledge management
Efficient inclusion for a class of XML types with interleaving and counting
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Optimal lower bounds on regular expression size using communication complexity
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Schema design for XML repositories: complexity and tractability
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Simplifying XML schema: single-type approximations of regular tree languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ambiguous content and disambiguation of XML schemata
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Checking determinism of XML Schema content models in optimal time
Information Systems
Assisting the design of XML schema: diagnosing nondeterministic content models
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Journal of Computer and System Sciences
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Developing and analyzing XSDs through BonXai
Proceedings of the VLDB Endowment
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Deciding definability by deterministic regular expressions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Discovering XSD keys from XML data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Simplifying XML Schema: Single-type approximations of regular tree languages
Journal of Computer and System Sciences
International Journal of Information Technology and Web Engineering
Hi-index | 0.00 |
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many nontransparent restrictions unnecessarily complicate the design of XSDs. For instance, complex content models in XML Schema are constrained by the infamous unique particle attribution (UPA) constraint. In formal language theoretic terms, this constraint restricts content models to deterministic regular expressions. As the latter constitute a semantic notion and no simple corresponding syntactical characterization is known, it is very difficult for non-expert users to understand exactly when and why content models do or do not violate UPA. In the present paper, we therefore investigate solutions to relieve users from the burden of UPA by automatically transforming nondeterministic expressions into concise deterministic ones defining the same language or constituting good approximations. The presented techniques facilitate XSD construction by reducing the design task at hand more towards the complexity of the modeling task. In addition, our algorithms can serve as a plug-in for any model management tool which supports export to XML Schema format.