Treffer: Deductive entity relationship modeling
Title:
Deductive entity relationship modeling
Authors:
Source:
IEEE transactions on knowledge and data engineering. 5(3):439-450
Publisher Information:
New York, NY: IEEE Computer Society, 1993.
Publication Year:
1993
Physical Description:
print, 25 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Psychology, psychopathology, psychiatry, Psychologie, psychopathologie, psychiatrie, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Base donnée, Database, Base dato, Complexité calcul, Computing complexity, Complejidad cálculo, Dépendance, Dependence, Dependencia, Modèle entité relation, Entity relationship model, Modelo entidad relación, Déduction, Deduction, Environnement modélisation base donnée, Database modeling environment, Modélisation conceptuelle, Conceptual modeling, Modélisation donnée, Data modeling, Sémantique entité relation, Entity relationship semantics
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. studi Roma La Sapienza', dip. informatica sistemistica, 00198 Rome, Italy
ISSN:
1041-4347
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4920510
Database:
PASCAL Archive
Weitere Informationen
We present an entity relationship oriented model, which essentially includes the notion of class, together with different types of assertions on classes. The assertions are used to model IS-A and disjointness relations both between entities and between relationships, part-of relations between entities and relationships, mandatory participation of an entity in a relationship, and interdependencies between the projections of relationships. We define the semantics of the model in terms of first-order logic, and present a sound and complete inference algorithm for such a model. The algorithm is shown to have polynomial time complexity in the case where interdependencies on the projections of relationships are not taken into account.