Using Regular Tree Automata as XML schemas
Authors:
Boris Chidlovskii
IEEE Advances in Digital Libraries Conference, Washington, May 2000
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.
Year:
2000
Report number:
1999/039
Attachments
adl00.ps (144.30 kB)
