Towards efficient implementation of XML schema content models

Authors:
Pekka Kilpeläinen;Rauno Tuhkanen
Affiliations:
University of Kuopio, Kuopio, Finland;University of Kuopio, Kuopio, Finland
Venue:
Proceedings of the 2004 ACM symposium on Document engineering
Year:
2004

Citing 7
Cited 8

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Parsing theory. Vol. 1: languages and parsing

Parsing theory. Vol. 1: languages and parsing
Programming perl

Programming perl
Regular expressions into finite automata

Theoretical Computer Science
Mastering regular expressions

Mastering regular expressions
One-unambiguous regular languages

Information and Computation
An open graph visualization system and its applications to software engineering

Software—Practice & Experience - Special issue on discrete algorithm engineering

One-unambiguity of regular expressions with numeric occurrence indicators

Information and Computation
Simple off the shelf abstractions for XML schema

ACM SIGMOD Record
Regular Expressions with Numerical Constraints and Automata with Counters

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Checking determinism of XML Schema content models in optimal time

Information Systems
Optimizing schema languages for XML: numerical constraints and interleaving

ICDT'07 Proceedings of the 11th international conference on Database Theory
The membership problem for regular expressions with unordered concatenation and numerical constraints

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Regular Expressions with Counting: Weak versus Strong Determinism

SIAM Journal on Computing
Checking determinism of regular expressions with counting

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

XML Schema uses an extension of traditional regular expressions for describing allowed contents of document elements. Iteration is described through numeric attributes minOccurs and maxOccurs attached to content-describing elements such as sequence, choice, and element. These numeric occurrence indicators are a challenge to standard automata-based solutions. Straightforward solutions require space that is exponential with respect to the length of the expressions.We describe a strategy to implement unambiguous content model expressions as counter automata, which are of linear size only.