Simplifying XML schema
Authors:
Open Access
- 29 June 2009
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 731-744
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- XPath satisfiability in the presence of DTDsJournal of the ACM, 2008
- One-unambiguity of regular expressions with numeric occurrence indicatorsInformation and Computation, 2007
- Expressiveness and complexity of XML SchemaACM Transactions on Database Systems, 2006
- Query optimization in XML structured-document databasesThe VLDB Journal, 2006
- Attribute grammars for scalable query processing on XML streamsThe VLDB Journal, 2006
- Studying the XML Web: Gathering Statistics from an XML SampleWorld Wide Web, 2005
- Complexity of Decision Problems for Simple Regular Expressions2004
- A survey of approaches to automatic schema matchingThe VLDB Journal, 2001
- One-Unambiguous Regular LanguagesInformation and Computation, 1998
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966