Conservative Type Extensions for XML Data

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-00822430
Contributor : Pierre Réty <>
Submitted on : Tuesday, May 14, 2013 - 4:27:11 PM
Last modification on : Thursday, February 7, 2019 - 4:47:09 PM

Identifiers

  • HAL Id : hal-00822430, version 1

Collections

Citation

Jacques Chabin, Mirian Halfeld Ferrari, Martin A. Musicante, Pierre Réty. Conservative Type Extensions for XML Data. Transactions on Large-Scale Data- and Knowledge-Centered Systems, Springer Berlin / Heidelberg, 2013, LNCS, 7980 (IX). ⟨hal-00822430⟩

Share

Metrics

Record views

143