ACM Home Page
Please provide us with feedback. Feedback
From ternary relationship to relational tables: a case against common beliefs
Full text PdfPdf (376 KB)
Source ACM SIGMOD Record archive
Volume 31 ,  Issue 2  (June 2002) table of contents
COLUMN: Articles table of contents
Pages: 46 - 49  
Year of Publication: 2002
ISSN:0163-5808
Author
Rafael Camps Paré  Universitat Politècnica de Catalunya (Barcelona)
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 55,   Citation Count: 3
Additional Information:

abstract   references   cited by  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/565117.565125
What is a DOI?

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).