The paper presents a formal language for specifying database schema transformations. This language consists of a set of primitive operations and a compositiono perator.Each of the primitive operators has associated the conditions under which it can be applied. A rule is given for generating the applicability conditions of a composed transformation from those of the components transformations. The paper shows how the language can be exploited for supportingn a flexible and correct data base schema design also when other transformational frameworks ar used.
An extendible language for database schema refinement transformations
Castelli D;
2001
Abstract
The paper presents a formal language for specifying database schema transformations. This language consists of a set of primitive operations and a compositiono perator.Each of the primitive operators has associated the conditions under which it can be applied. A rule is given for generating the applicability conditions of a composed transformation from those of the components transformations. The paper shows how the language can be exploited for supportingn a flexible and correct data base schema design also when other transformational frameworks ar used.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_251589-doc_67311.pdf
accesso aperto
Descrizione: An extendible language for database schema refinement transformations
Tipologia:
Versione Editoriale (PDF)
Dimensione
153.25 kB
Formato
Adobe PDF
|
153.25 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
