Minimal tree language extensions: a keystone of XML type compatibility and evolution

Authors:
Jacques Chabin;Mirian Halfeld-Ferrari;Martin A. Musicante;Pierre Réty
Affiliations:
Université d'Orléans, LIFO, Orléans, France;Université d'Orléans, LIFO, Orléans, France;Universidade Federal do Rio Grande do Norte, DIMAp Natal, Brazil;Université d'Orléans, LIFO, Orléans, France
Venue:
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Year:
2010

Citing 14
Cited 1

Computational learning theory: survey and selected bibliography

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Recent advances of grammatical inference

Theoretical Computer Science - Special issue on algorithmic learning theory
DTD inference for views of XML data

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XTRACT: a system for extracting document type descriptors from XML documents

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
XML to Relational Conversion Using Theory of Regular Tree Grammars

Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
Impact of XML schema evolution on valid documents

Proceedings of the 7th annual ACM international workshop on Web information and data management
Managing Semi-Structured Data

Queue - Semi-structured Data
Taxonomy of XML schema languages using formal language theory

ACM Transactions on Internet Technology (TOIT)
Inference of concise DTDs from XML data

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Expressiveness and complexity of XML Schema

ACM Transactions on Database Systems (TODS)
Learning tree languages from positive examples and membership queries

Theoretical Computer Science
Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)

Journal of Algorithms
Inferring XML schema definitions from XML data

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Distributed XML design

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Conservative type extensions for XML data

Transactions on Large-Scale Data- and Knowledge-centered systems IX

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose algorithms that extend a given regular tree grammar G0 to a new grammar G respecting the following two properties: (i) G belongs to the sub-class of local or single-type tree grammars and (ii) G is the least grammar (in the sense of language inclusion) that contains the language of G0. Our algorithms give rise to important tools in the context of web service composition or XML schema evolution. We are particularly interested in applying them in order to reconcile different XML type messages among services. The algorithms are proven correct and some of their applications are discussed.