Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Generating test cases for web services using data perturbation
ACM SIGSOFT Software Engineering Notes
A Typed DOM for the Management of MPEG-7 Media Descriptions
Multimedia Tools and Applications
PTDOM: a schema-aware XML database system for MPEG-7 media descriptions
Software—Practice & Experience - Research Articles
Journal of Computer and System Sciences
Towards automatic document migration: semantic preservation of embedded queries
Proceedings of the 2007 ACM symposium on Document engineering
Modeling the Dance Video Semantics using Regular Tree Automata
Fundamenta Informaticae
Rewriting XPath Expressions Depending on Path Summary
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Smoothing and compression with stochastic k-testable tree languages
Pattern Recognition
XML: some papers in a haystack
ACM SIGMOD Record
Improving data perturbation testing techniques for Web services
Information Sciences: an International Journal
A testing approach for XML schemas
COMPSAC-W'05 Proceedings of the 29th annual international conference on Computer software and applications conference
Unification of XML DTD for XML documents with similar structure
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Modeling the Dance Video Semantics using Regular Tree Automata
Fundamenta Informaticae
| Hi-index | 0.00 |
We address the problem of tight XML schemas and use 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.