.png){kind=icon}
.png){kind=icon}
Return
On the relational representation of complex specialization structures
.png){kind=icon}
PRE
AI
DOI：10.1016/S0306-4379(00)00025-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The mapping of entity-relationship schemas (ER schemas) that contain complex specialization structures into the relational model requires the use of specific strategies to avoid inconsistent states in the final relational database. In this paper, we show that for this mapping to be correct it is required to enforce a special kind of integrity constraint, the key pairing constraint (KPC). We present a mapping strategy that use simple inclusion dependencies to enforce KPC and show that this strategy can be used to correctly map specialization structures that are more general than the simple specialization structures considered by previous strategies. (C) 2000 Published by Elsevier Science Ltd.
Keywords:
ER model
relational database design
specialization structures
integrity constraints
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
2.8K
Citations:
1.8K
Organization
No organization information available