## Foundations of Object Oriented Database Concepts

Schewe, Klaus-Dieter ; Thalheim, Bernhard ; Wetzel, Ingrid

URN | urn:nbn:de:gbv:18-228-7-259 |
---|---|

URL | http://edoc.sub.uni-hamburg.de/informatik/volltexte/2009/25/ |

Dokumentart: | Report (Bericht) |

Schriftenreihe: | Berichte des Fachbereichs Informatik der Universität Hamburg |

Bandnummer: | 157 |

Sprache: | Englisch |

Erstellungsjahr: | 1992 |

Publikationsdatum: | 02.07.2009 |

SWD-Schlagwörter: | Datenbank |

Freie Schlagwörter (Deutsch): | Grundlagen,Object-Oriertierte Datenbanken, Konzepte |

Freie Schlagwörter (Englisch): | Foundations of Object Oriented Database Concepts |

DDC-Sachgruppe: | Informatik |

BK - Klassifikation: | 54.64 |

### Kurzfassung auf Englisch:

It is claimed that object oriented databases (OODBs) overcome many of the limitations of the relational model. However, the formal foundation of OODB concepts is still an open problem. Even worse, for relational databases a commonly accepted datamodel existed very early on whereas for OODBs the uni,cation of concepts is outstanding. Our research in Hamburg and Rostock is directed towards a formally founded object oriented datamodel (OODM) and to contribute to the development of a uniform mathematical theory of OODBs. This report contains the results of our first investigations on the OODM. A clear distinction between objects and values turns out to be essential in the OODM. Types and Classes are used to structure values and objects repectively. Then the problem of unique object identi,cation occurs. We show that this problem can be be solved for classes with extents that are completely representable by values. Such classes are called valuerepresentable. The finiteness of a database and the existence of finitely representable rational tree types are sufficient to decide value-representability. Another advantage of the relational approach is the existence of structurally determined canonical update operations. We show that this property can be carried over to object-oriented datamodels i, classes are value-representable. Moreover, in this case database consistency with respect to implicitly specified referential and inclusion constraints will be automatically preserved. This result can be generalized with respect to distinguished classes of explicitly stated static constraints. We show that integrity enforcement is always possible. Given some arbitrary method S and some static or transition constraint I there exists a greatest consistent specialization (GCS) SI of S with respect to I. Such a GCS behaves nice in that it is compatible with the conjunction of constraints, inheritance and refinement. For the GCS construction of a user-defined operation, however, it is in general not suffcient to replace the involved primitive update operations by their GCSs. From an engineering point of view an algorithm is required to generate these consistent operations. We address this construction problem by the specification of generators for them. These generators will be based on the possibility to represent syntactic components of the language as values within the language itself, which is known to form the basis of linguistic reflection. Moreover, the generators involve a single generic proof of correctness hence relieve the user of the burden to write basic update operations and to assure their consistency.

### Kurzfassung auf Englisch:

It is claimed that object oriented databases (OODBs) overcome many of the limitations of the relational model. However, the formal foundation of OODB concepts is still an open problem. Even worse, for relational databases a commonly accepted datamodel existed very early on whereas for OODBs the uni,cation of concepts is outstanding. Our research in Hamburg and Rostock is directed towards a formally founded object oriented datamodel (OODM) and to contribute to the development of a uniform mathematical theory of OODBs. This report contains the results of our first investigations on the OODM. A clear distinction between objects and values turns out to be essential in the OODM. Types and Classes are used to structure values and objects repectively. Then the problem of unique object identi,cation occurs. We show that this problem can be be solved for classes with extents that are completely representable by values. Such classes are called valuerepresentable. The finiteness of a database and the existence of finitely representable rational tree types are sufficient to decide value-representability. Another advantage of the relational approach is the existence of structurally determined canonical update operations. We show that this property can be carried over to object-oriented datamodels i, classes are value-representable. Moreover, in this case database consistency with respect to implicitly specified referential and inclusion constraints will be automatically preserved. This result can be generalized with respect to distinguished classes of explicitly stated static constraints. We show that integrity enforcement is always possible. Given some arbitrary method S and some static or transition constraint I there exists a greatest consistent specialization (GCS) SI of S with respect to I. Such a GCS behaves nice in that it is compatible with the conjunction of constraints, inheritance and refinement. For the GCS construction of a user-defined operation, however, it is in general not suffcient to replace the involved primitive update operations by their GCSs. From an engineering point of view an algorithm is required to generate these consistent operations. We address this construction problem by the specification of generators for them. These generators will be based on the possibility to represent syntactic components of the language as values within the language itself, which is known to form the basis of linguistic reflection. Moreover, the generators involve a single generic proof of correctness hence relieve the user of the burden to write basic update operations and to assure their consistency.

### Hinweis zum Urherberrecht

Für Dokumente, die in elektronischer Form über Datenenetze angeboten werden, gilt uneingeschränkt das Urheberrechtsgesetz (UrhG). Insbesondere gilt:

Einzelne Vervielfältigungen, z.B. Kopien und Ausdrucke, dürfen nur zum privaten und sonstigen eigenen Gebrauch angefertigt werden (Paragraph 53 Urheberrecht). Die Herstellung und Verbreitung von weiteren Reproduktionen ist nur mit ausdrücklicher Genehmigung des Urhebers gestattet.

Der Benutzer ist für die Einhaltung der Rechtsvorschriften selbst verantwortlich und kann bei Mißbrauch haftbar gemacht werden.