logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

DEDUCTIVE ENTITY-RELATIONSHIP MODELING

delete1993-06-01
delete14
PRE
AI
D
DIBATTISTA, G *
M
Maurizio Lenzerini
DOI：10.1109/69.224196delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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. We argue that our model and the associated inference capabilities provide a suitable formal basis for designing an effective environment supporting conceptual modeling.
Keywords:
DATA MODELING
CONCEPTUAL MODELING
ENTITY RELATIONSHIP MODEL
ENTITY RELATIONSHIP SEMANTICS
DEDUCTION
COMPUTATIONAL COMPLEXITY
DEPENDENCIES
DATABASE MODELING ENVIRONMENT
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.7K
Citations:
3.2W

Organization

No organization information available