Sciweavers

Share
SIGMOD
2009
ACM

Simplifying XML schema: effortless handling of nondeterministic regular expressions

9 years 9 months ago
Simplifying XML schema: effortless handling of nondeterministic regular expressions
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 technique...
Geert Jan Bex, Wouter Gelade, Wim Martens, Frank N
Added 05 Dec 2009
Updated 05 Dec 2009
Type Conference
Year 2009
Where SIGMOD
Authors Geert Jan Bex, Wouter Gelade, Wim Martens, Frank Neven
Comments (0)
books