×
Bekessy, A.; Demetrovics, J.

Contribution to the theory of data base relations. (English) Zbl 0399.68029

Discrete Math. 27, 1-10 (1979).
Page: Show Scanned Page
scan of Zbl 0399.68029

Cited in 2 Reviews
Cited in 10 Documents

MSC:

68P05 Data structures

Keywords:

Data Base Relations
Cite Review PDF
Full Text: DOI

References:

[1] Codd, E. F., A relation model of data for large shared data banks, CACM, 13, 6 (1970) · Zbl 0207.18003
[2] Codd, E. F., Further normalization of the data base relational model, (Courant Inst. Comp. Sci. Symp. 6, Data Base Systems (1971), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ), 33-64
[3] Sperner, E., Ein Satz über Untermengen einer endlichen Menge, Math. Zeitschrift, Band 27, 544-548 (1928) · JFM 54.0090.06
[4] Armstrong, W. W., Dependency structures of data base relationships, (Information Processing, 74 (1974), North-Holland: North-Holland Amsterdam), 580-583 · Zbl 0296.68038
[5] Delobel, C.; Casey, R. G., Decomposition of a data base and the theory of Boolean switching functions, IBM J. Res. and Dev., 17, 374-386 (1973) · Zbl 0259.68016
[6] Yu, C. T.; Johnson, D. T., On the complexity of finding the set of candidate keys for a given set of functional dependencies, Information Processing Lett., 5, 4, 100-101 (1976) · Zbl 0336.68018
[7] S.L. Osborne, and F.Wm. Tompa, Comment on Yu and Johnson’s bound on the complexity of finding candidates keys (preprint).; S.L. Osborne, and F.Wm. Tompa, Comment on Yu and Johnson’s bound on the complexity of finding candidates keys (preprint).
[8] Fadous, R. Y., Mathematical foundations for relational data bases, (Ph.D. Dissertation (1975), Computer Science Dept., Michigan Univ)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.