Ambiguous content and disambiguation of XML schemata

  • Authors:
  • Kalpdrum Passi;Don Morgan

  • Affiliations:
  • Laurentian University, Sudbury, Ontario, Canada;McMaster University, Hamilton, Ontario, Canada

  • Venue:
  • Proceedings of the Fourteenth International Database Engineering & Applications Symposium
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.