Optimizing Schema Languages for XML: Numerical Constraints and Interleaving

DOI10.1137/070697367zbMath1187.68191OpenAlexW2023629560MaRDI QIDQ3642874

Wouter Gelade, Wim Martens, Frank Neven

Publication date: 6 November 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/60d94c0db73a44182020c0ebae65acf80077d357

zbMATH Keywords

optimizationcomplexityregular expressionsXML schema languages

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Shuffled languages -- representation and recognition ⋮ Schemas for unordered XML on a DIME ⋮ On the complexity and decidability of some problems involving shuffle ⋮ Efficient inclusion for a class of XML types with interleaving and counting ⋮ Regular Expressions with Counting: Weak versus Strong Determinism

Uses Software

• XDuce

This page was built for publication: Optimizing Schema Languages for XML: Numerical Constraints and Interleaving