Succinctness of pattern-based schema languages for XML

DOI10.1016/j.jcss.2010.04.008zbMath1215.68090OpenAlexW2052869864MaRDI QIDQ532368

Frank Neven, Wouter Gelade

Publication date: 4 May 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/14382

zbMATH Keywords

complexityXML schema languagesschema transformation

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Generating, sampling and counting subclasses of regular tree languages ⋮ Simplifying XML schema: single-type approximations of regular tree languages

Uses Software

• Relax NG

Cites Work

• A lower bound technique for the size of nondeterministic finite automata
• Regular expressions into finite automata
• One-unambiguous regular languages
• Unnamed Item
• Unnamed Item