Elemntary actions on an extended entity relationship database

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Semantic data models have been widely studied for the conceptual specification of databases. However, most of these data models are restricted to the description of the static structure of a database. They do not provide means to specify the dynamic behaviour of a database. This paper sketches a language for the specification of actions on databases which have been specified by an Extended Entity-Relationship (EER) schema. These actions are based on so-called elementary actions, which are automatically be derived from the EER schema. So, it can always be guaranteed that these schema dependent elementary actions preserve all inherent integrity constraints. The semantics of the elementary actions is given in two steps: First, it is shown how the semantics of a database schema, i.e., a current database state, can be represented by an attributed graph. Then, the semantics of elementary actions is given by programmed graph replacements.

Cite

CITATION STYLE

APA

Engels, G. (1991). Elemntary actions on an extended entity relationship database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 344–362). Springer Verlag. https://doi.org/10.1007/BFb0017399

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free