A model for compound type changes encountered in schema evolution
Author:
Open Access
- 1 March 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 25 (1) , 83-127
Abstract
Schema evolution is a problem that is faced by long-lived data. When a schema changes, existing persistent data can become inaccessible unless the database system provides mechanisms to access data created with previous versions of the schema. Most existing systems that support schema evolution focus on changes local to individual types within the schema, thereby limiting the changes that the database maintainer can perform. We have developed a model of type changes involving multiple types. The model describes both type changes and their impact on data by defining derivation rules to initialize new data based on the existing data. The derivation rules can describe local and nonlocal changes to types to capture the intent of a large class of type change operations. We have built a system called Tess (Type Evolution Software System) that uses this model to recognize type changes by comparing schemas and then produces a transformer that can update data in a database to correspond to a newer version of the schema.Keywords
This publication has 25 references indexed in Scilit:
- An Integrated Approach to Schema Evolution for Object Databases1997
- TransformGen: automating the maintenance of structure-oriented environmentsACM Transactions on Programming Languages and Systems, 1994
- Schema evolution and integrationDistributed and Parallel Databases, 1994
- Subtyping recursive typesACM Transactions on Programming Languages and Systems, 1993
- Refactoring and aggregation1993
- Unified class evolution by object-oriented viewsLecture Notes in Computer Science, 1992
- On dynamically updating a computer program: From concept to prototypeJournal of Systems and Software, 1991
- Gandalf: Software development environmentsIEEE Transactions on Software Engineering, 1986
- An Approach to Persistent ProgrammingThe Computer Journal, 1983
- Approximate String MatchingACM Computing Surveys, 1980