Some results about normal forms for functional dependency in the relational datamodel

Discrete Applied Mathematics

Volumn 69, Issue 1-2, 1996, Pages 61-74

  Demetrovics, János ^a   Thi, Vu Duc ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b Natl Ctr for Sci Res of Vietnam   (Viet Nam)

Author keywords

Antikey; Boyce Codd normal form; Closed set; Closure; Functional dependency; Key; Minimal generator; Minimal key; Relation; Relation scheme; Relational datamodel; Second normal form; Third normal form

Indexed keywords

EID: 0042040483     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00076-4     Document Type: Article

References (19)

1. W.W. Armstrong, Dependency structures of database relationships, Inform. Process. 74 (1974) 580-583.
2. C. Beeri and P.A. Bernstein, Computational problems related to the design of normal form relational schemes. ACM Trans. Database Systems 4 (1979) 30-59.
3. C. Beeri, M. Dowd, R. Fagin and R. Staman On the structure of Armstrong relations for functional dependencies, J ACM 31 (1984) 30-46.
4. P.A. Bernstein, Synthesizing third normal form relations from functional dependencies, ACM Trans. Database Systems 1 (1976) 277-298.
5. G. Burosch, J. Demetrovics and G.O.H. Katona, The poset of closures as a model of changing databases, Order 4 (1987) 127-142.
6. J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acta Cybernet. 4 (1979) 247-252.
7. J. Demetrovics, Logical and structural investigation of relational datamodel (Hungarian language), MTA-SZTAKI Tanulmanyok, Budapest, 114 (1980) 1-97.
8. J. Demetrovics, G. Hencsey, L.O. Libkin and I.B. Muchnik, Normal form relation schemes: a new characterization, Manuscript.
9. J. Demetrovics and V.D. Thi, Some results about functional dependencies, Acta Cybernetica Hungary VIII/3 (1988) 273-278.
10. J. Demetrovics, V.D. Thi, Relations and minimal keys, Acta Cybernetica Hungary VIII/3 (1988) 279-285.
11. J. Demetrovics and V.D. Thi, On keys in the relational datamodel, EIK 24 (1988) 515-519.
12. G. Gottlob and L. Libkin, Investigations on Armstrong relations, dependency inference, and excluded functional dependencies, Acta Cybernetica Hungary Tom.9 Fasc.4 (1990) 385-402.
13. C.L. Lucchesi and S.L. Osborn, Candidate keys for relations, J. Comput. Systems Sci. 17 (1978) 270-279.
14. D. Maier, Minimum cover in the relational database model, JACM 27 (1980) 664-674.
15. H. Mannila and K.J. Raiha, Design by example: an application of Armstrong relations, J. Comput. Systems Sci. 33 (1986) 126-141.
16. H. Mannila and K.J. Raiha, Practical Algorithms for finding prime attributes and testing normal forms, Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Philadelphia, PA (ACM, New York, 1989) 128-133.
17. S.L. Osborn, Testing for existence of a covering Boyce-Codd normal form, Infor. Proc. Lett. 8 (1979) 11-14.
18. V.D. Thi, Investigation on combinatorial characterizations related to functional dependency in the relational datamodel (Hungarian language), MTA-SZTAKI Tanulmanyok, Budapest, 191 (1986) 1-157. Ph.D. dissertation.
19. V.D. Thi, Minimal keys and Antikeys, Acta Cybernet. Hungary Tom.7 Fasc.4 (1986) 361-371.