ACM Home Page
Please provide us with feedback. Feedback
Normalization and hierarchical dependencies in the relational data model
Full text PdfPdf (1.40 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 3 ,  Issue 3  (September 1978) table of contents
Pages: 201 - 222  
Year of Publication: 1978
ISSN:0362-5915
Author
Claude Delobel  Univ. of Grenoble, Grenoble, France
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 117,   Citation Count: 37
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/320263.320271
What is a DOI?

ABSTRACT

The purpose of this paper is to present a new approach to the conceptual design of logical schemata for relational databases. One-to-one, one-to-many, and many-to-many relationships between the attributes of database relations are modeled by means of functional dependencies and multivalued dependencies. A new type of dependency is introduced: first-order hierarchical decomposition. The properties of this new type of dependency are studied and related to the normalization process of relations. The relationship between the concept of first-order hierarchical decomposition and the notion of hierarchical organization of data is discussed through the normalization process.


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
ARMSTRONG, W.W. Dependency structures of database relationships. Information Processing 74, North-Holland, Amsterdam, 1974, pp. 580-583.
2
 
3
4
 
5
BOITIEAUX, J. Etude math4matique d'un ensemble de notions. Contrat DGRST 67.01.015, D~l~gation G~n~rale/~ la Recherche Scientifique et Technique, Paris, 1969.
6
 
7
CODD, E.F. Further normalization of the database relational model. Courant Computer Science Symposium 6, Database Systems, Prentice-Haft, Englewood Cliffs, N.J., 1971, pp. 65-98.
 
8
DELOBEL, C. Aspects th~oriques sur la structure de {'information dans une base de donn~es. Revue Informatique et Recherche Operationnelle B.3 ( 1971 ), 37-64.
 
9
DELOBEL, C., AND CASEY, R.G. Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. and Develop. 17, 5 (1973), 374-386.
 
10
DELOBEL, C., AND LEONARD, M. The decomposition process in a relational model. Proc. Int. Workshop on Data Structures, IRIA, Namur, Belgium, May 1974, pp. 57-80.
11
 
12
LEONARD, M., AND REYNAUD, F. Existence du consensus et caxact~risation des couvertures et bases irredondantes d'une fonction Y~ #,A/. Rapport de recherche, Comptng. Lab., U. of Grenoble, Grenoble, France, Sept. 1976. Submitted to Discrete Math.
 
13
REYNAUD, F., LEONARD, M., AND PICHAT, E. Calculation of the prime implications and their irredundant covers in data bases. Res. Rep. #3, Conservatoire National des Arts et M~tiers, Institut d'Informatique d'Entreprise, Paris, June 1977.
14
15
 
16
WANG, C.P., AND WEDEKIND, H.H. Segment synthesis in logical data base design. IBM J. Res. and Develop. 19, 1 (Jan. 1975), 71-77.
 
17

CITED BY  37
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 


Peer to Peer - Readers of this Article have also read: