Candidate keys for relations. (English) Zbl 0395.68025


68P05 Data structures
68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
68P20 Information storage and retrieval of data
Full Text: DOI


[1] Bernstein, P.A., Normalization and functional dependencies in the relational data base model, ()
[2] Bernstein, P.A.; Beeri, C., An algorithmic approach to normalization of relational data base systems, ()
[3] Bernstein, P.A.; Swenson, J.R.; Tsichritzis, D.C., A unified approach to functional dependencies and relations, (), 237-245
[4] Codd, E.F., A relational model of data for large shared data banks, Comm. ACM, 13, No. 6, 377-387, (1970) · Zbl 0207.18003
[5] Codd, E.F., Further normalization of the data base relational model, (), 33-64
[6] Cook, S.A., The complexity of theorem proving procedures, (), 151-158 · Zbl 0363.68125
[7] Delobel, C.; Casey, R.G., Decomposition of a data base and the theory of Boolean switching functions, IBM J. res. develop., 17, No. 5, 374-386, (1973) · Zbl 0259.68016
[8] Fadous, R.; Forsyth, J., Finding candidate keys for relational data bases, (), 203-210
[9] Karp, R.M., Reducibility among combinatorial problems, (), 85-103 · Zbl 0366.68041
[10] Osborn, S.L., Normal forms for relational data bases, ()
[11] Tutte, W.T., Connectivity in graphs, (1966), University of Toronto Press · Zbl 0146.45603
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.