Relational Schema Evolution for Program Independency
The database schema is assumed to be stable enough to remain valid even as the modeled environment changes. However, in practice, data models are not nearly as stable as commonly assumed by the database designers. Even though a rich set of schema change operations is provided in current database sys...
Saved in:
Published in | Intelligent Information Technology pp. 273 - 281 |
---|---|
Main Author | |
Format | Book Chapter Conference Proceeding |
Language | English |
Published |
Berlin, Heidelberg
Springer Berlin Heidelberg
01.01.2004
Springer |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The database schema is assumed to be stable enough to remain valid even as the modeled environment changes. However, in practice, data models are not nearly as stable as commonly assumed by the database designers. Even though a rich set of schema change operations is provided in current database systems, the users suffer from the problem that schema change usually impacts existing application programs that have been written against the schema. In this paper, we are exploring the possible solutions to overcome this problem of impacts on the application programs. We believe that for continued support of the existing programs on the old schema, the old schema should continue to allow updates and queries, as before. Furthermore, its associated data has to be kept up-to-date. We call this the program independency property of schema change tools. For this property, we devise so-called program independency schema evolution (PISE) methodology. For each of the set of schema change operations in the relational schemas, the overview of the additional code blocks due to the PISE compliance is presented in order to prove the comprehensiveness and soundness of our PISE methodology. |
---|---|
Bibliography: | This work was supported by the University of Seoul, in 2003. |
ISBN: | 9783540241263 3540241264 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-540-30561-3_29 |