|
ABSTRACT
The transformation from n-ary relationships to a relational database schema has never been really fully analyzed. This paper presents one of the several ternary cases ignored by the ER-to-RM literature. The case shows that the following common belief is wrong: Given a set of FDs over a table resulting in a non-3NF situation, it is always possible to obtain a fully equivalent set of 3NF tables, without adding other restrictions than candidate keys and elementary inclusion dependencies.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
R. Camps, "Transforming N-ary Relationships to Database Schemas: An Old and Forgotten Problem", Research Repot LSI-5-02R of Universitat Politècnica de Catalunya (Spain).
|
 |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
A. Rochfeld and H. Tardieu, "MERISE: An information system design and development methodology", Information & Management, 6, 143-159 (1983).
|
| |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
Yourdon,Inc., Yourdon Method, Prentice-Hall (1993).
|
|