On the number of candidate keys. (English) Zbl 0394.68015


68P05 Data structures
68P20 Information storage and retrieval of data
Full Text: DOI


[1] Codd, E.F., A relational model of data for large shared data banks, Comm. ACM, 13, 377-387, (1970) · Zbl 0207.18003
[2] Codd, E.F., Normalized data base structure: A brief tutorial, Proc. ACM-SIGFIDET workshop on data description, access and control, (1971)
[3] Codd, E.F., Further normalization of the data base relational model, (), 33-64
[4] Delobel, C.; Casey, R.G., Decomposition of a data base and the theory of Boolean switching functions, IBM J. res. develop., 17, 374-386, (1973) · Zbl 0259.68016
[5] Fadous, R.; Forsyth, J., Finding candidate keys for relational data bases, Proc. ACM SIGMOD, 203-210, (1975)
[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] Sperner, E., Eine satz uber untermengen einer endlichen menge, Math. Z., 27, 544-548, (1928) · JFM 54.0090.06
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.