×
Yu, C. T.; Johnson, D. T.

On the complexity of finding the set of candidate keys for a given set of functional dependencies. (English) Zbl 0336.68018

Inf. Process. Lett. 5, 100-101 (1976).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0336.68018

Cited in 5 Documents

MSC:

68N01 General topics in the theory of software
68W99 Algorithms in computer science
68Q25 Analysis of algorithms and problem complexity
Cite Review PDF
Full Text: DOI

References:

[1] Codd, E. F., A relational model of data for large shared data banks, CACM, 13, 377-387 (1970) · Zbl 0207.18003
[2] E.F. Codd, Normalized data base structure: A brief tutorial, Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control.; E.F. Codd, Normalized data base structure: A brief tutorial, Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control. · Zbl 0296.68041
[3] Codd, E. F., Further normalization of the data base relational model, (Courant Computer Science Symposia 6 “Data Base Systems” (1971), Prentice Hall: Prentice Hall Englewood Cliffs, N.J), 33-64
[4] Delobel, C.; Casey, R. G., Decomposition of a data base and the theory of boolean switching functions, IBM J. Res. & Devel., 17, 374-386 (1973), Sept. · Zbl 0259.68016
[5] R. Fadous, J. Forsyth, Finding candidate keys for relational data bases, Proc. 1975 ACM SIGMOD, pp. 203-210.; R. Fadous, J. Forsyth, Finding candidate keys for relational data bases, Proc. 1975 ACM SIGMOD, pp. 203-210.
[6] Armstrong, W. W., Dependency structures of data base relationships, (Information Processing, 74 (1974), North-Holland Publ. Co), 580-583 · Zbl 0296.68038
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.