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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahonen, H.: Disambiguation of SGML content models. In: Nicholas, C., Wood, D. (eds.) PODDP 1996 and PODP 1996. LNCS, vol. 1293, Springer, Heidelberg (1997)
Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
Bouchou, B., Duarte, D., Halfeld Ferrari Alves, M., Laurent, D., Musicante, M.: Evolving schemas for XML: An incremental approach. Technical Report (to appear), Université de François Rabelais, LI (2004)
Bouchou, B., Duarte, D., Halfeld Ferrari Alves, M., Laurent, D.: Extending tree automata to model XML validation under element and attribute constraints. In: ICEIS (2003)
Bouchou, B., Halfeld Ferrari Alves, M.: Updates and incremental validation of XML documents. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 216–232. Springer, Heidelberg (2004)
van den Brand, M.G.J., Heering, J., Klint, P., Olivier, P.A.: Compiling rewrite systems: The ASF+SDF compiler. ACM, Transactions on Programming Languages and Systems 24 (2002)
Caron, P., Ziadi, D.: Characterization of Glushkov automata. TCS: Theorical Computer Science 233, 75–90 (2000)
Kuikka, E., Leinonen, P., Penttonen, M.: An approach to document structure transformations. In: Proceedings of Conference on Software: Theory and Practice, pp. 906–913 (2000)
Parekh, R., Honavar, V.: Learning DFA from simple examples. Machine Learning 44(1/2), 9–35 (2001)
Roddick, J., Al-Jadir, L., Bertossi, L., Dumas, M., Estrella, F., Gregersen, H., Hornsby, K., Lufter, J., Mandreoli, F., Männistö, T., Mayol, E., Wedemeijer, L.: Evolution and change in data management - issues and directions. SIGMOD Record 29(1), 21–25 (2000)
Sur, G.M., Hammer, J., Simeon, J.: An XQuery-based language for processing updates in XML. In: PLAN-X (2004)
Su, H., Kramer, D., Chen, L., Claypool, K.T., Rundensteiner, E.A.: XEM: Managing the evolution of XML documents. In: RIDE-DM, pp. 103–110 (2001)
Su, H., Kuno, H., Rundensteiner, E.A.: Automating the transformation of XML documents. In: 3rd WIDM, ACM, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouchou, B., Duarte, D., Alves, M.H.F., Laurent, D., Musicante, M.A. (2004). Schema Evolution for XML: A Consistency-Preserving Approach. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-28629-5_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22823-3
Online ISBN: 978-3-540-28629-5
eBook Packages: Springer Book Archive