Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

ADL
2000
Springer

favoriteEmaildiscussreport

225views Digital Library» more ADL 2000»

Using Regular Tree Automata as XML Schemas

13 years 9 months ago

Using Regular Tree Automata as XML Schemas

Download reference.kfupm.edu.sa

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

Real-time Traffic

ADL 2000 | Digital Library | Tree Automata | Tree Automata Model | XML DTDs |

claim paper

Related Content

» Languages Modulo Normalization

» Rewriting of visibly pushdown languages for xml data integration

» TypeBased Optimization for Regular Patterns

» Tree Automata for SchemaLevel Filtering of XML Associations

» A Direct Translation from XPath to Nondeterministic Automata

» On the minimization of XML Schemas and tree automata for unranked trees

» Simplifying XML schema singletype approximations of regular tree languages

» Reasoning about XML with temporal logics and automata

» DSD A schema language for XML

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	ADL
Authors	Boris Chidlovskii

Comments (0)