Schema evolution for XML: A consistency-preserving approach

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

Abstract

This paper deals with updates of XML documents that satisfy a given schema, e.g., a DTD. In this context, when a given update violates the schema, it might be the case that this update is accepted, thus implying to change the schema. Our method is intended to be used by a data administrator who is an expert in the domain of application of the database, but who is not required to be a computer science expert. Our approach consists in proposing different schema options that are derived from the original one. The method is consistency-preserving: documents valid with respect to the original schema remain valid. The schema evolution is implemented by an algorithm (called GREC) that performs changes on the graph of a finite state automaton and that generates regular expressions for the modified graphs. Each regular expression proposed by GREC is a choice of schema given to the administrator. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Bouchou, B., Duarte, D., Alves, M. H. F., Laurent, D., & Musicante, M. A. (2004). Schema evolution for XML: A consistency-preserving approach. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3153, 876–888. https://doi.org/10.1007/978-3-540-28629-5_69

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