Sciweavers

ADL
2000
Springer

Using Regular Tree Automata as XML Schemas

14 years 3 months ago
Using Regular Tree Automata as XML Schemas
We address the problem of tight XML schemas and propose regular tree automata to model XML data. We show that the tree automata model is more powerful that the XML DTDs and is closed under main algebraic operations. We introduce the XML query algebra based the tree automata model, and discuss the query optimization and query pruning techniques. Finally, we show the conversion of tree automata schema into XML DTDs.
Boris Chidlovskii
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where ADL
Authors Boris Chidlovskii
Comments (0)