Conservative type extensions for XML data

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a method for building a minimal XML type (belonging to standard class of regular tree grammars) as an extension of other given types. Not only do we propose an easy-to-handle XML type evolution method, but we prove that this method computes the smallest extension of a given tree grammar, respecting pre-established constraints. We also adapt our technique to an interactive context, where an advised user is guided to build a new XML type from existing ones. A basic prototype of our tool is implemented. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chabin, J., Halfeld Ferrari, M., Musicante, M. A., & Réty, P. (2013). Conservative type extensions for XML data. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7980, 65–94. https://doi.org/10.1007/978-3-642-40069-8_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free