Database Theory - ICDT 2005

DOI10.1007/B104421zbMATH Open1112.68356OpenAlexW4232873349MaRDI QIDQ5316616FDOQ5316616

Authors: Wim Martens, Frank Neven, Thomas Schwentick 

Publication date: 13 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104421

Recommendations

• The complexity of XPath query evaluation and XML typing
• Regular expression types for XML
• On the minimization of XML schemas and tree automata for unranked trees
• XML schema, tree logic and sheaves automata
• On the complexity of typechecking top-down XML transformations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Grammars and rewriting systems (68Q42)

Cited In (3)

• Efficient inclusion checking for deterministic tree automata and XML schemas
• Automata for XML -- a survey
• Streaming tree automata

Uses Software

• XDuce

This page was built for publication: Database Theory - ICDT 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316616)