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.
Type de document :
Article dans une revue
Transactions on Large-Scale Data- and Knowledge-Centered Systems, Springer Berlin / Heidelberg, 2013, LNCS, 7980 (IX)
Liste complète des métadonnées

https://hal.inria.fr/hal-00822430
Contributeur : Pierre Réty <>
Soumis le : mardi 14 mai 2013 - 16:27:11
Dernière modification le : mercredi 14 novembre 2018 - 11:18:29

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

114