One-unambiguous regular languages
Information and Computation
Automata and Computability
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Introduction to Languages and the Theory of Computation
Introduction to Languages and the Theory of Computation
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 Model for XML Schema Integration
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
XML Schema
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
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
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Hi-index | 0.00 |
In this paper we deal with the problem of ambiguous content in XML Schema systems. We explain the meaning of ambiguous content in XML documents, and how it relates to 1-unambiguous regular expressions. We then describe the Brüggemann-Klein and Wood algorithm for identifying 1-unambiguous regular expressions and languages, and finding equivalent 1-unambiguous expressions to those of ambiguous expressions. We discuss Ahonen's algorithm for disambiguating regular expressions, which results in an over-generalized expression. We present an improved algorithm that result in a more specific expression (i.e. a less generalized expression). We also give a method of converting XML Schema content models to regular expressions.