×
Lucchesi, Claudio L.; Osborn, Sylvia L.

Candidate keys for relations. (English) Zbl 0395.68025

J. Comput. Syst. Sci. 17, 270-279 (1978).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0395.68025

Cited in 5 Reviews
Cited in 34 Documents

MSC:

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

Keywords:

Candidate Keys; Relational Data Base; Algorithms; Np-Complete
Cite Review PDF
Full Text: DOI

References:

[1] Bernstein, P. A., Normalization and Functional Dependencies in the Relational Data Base Model, (Ph.D. Dissertation (1975), University of Toronto)
[2] Bernstein, P. A.; Beeri, C., An Algorithmic Approach to Normalization of Relational Data Base Systems, (CSRG 73 (1976), University of Toronto)
[3] Bernstein, P. A.; Swenson, J. R.; Tsichritzis, D. C., A unified approach to functional dependencies and relations, (Proc. ACM-SIGMOD International Conference on Management of Data (1975)), 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, (Rustin, R., Courant Computer Science Symposium 6, Data Base Systems (1971), Prentice-Hall), 33-64
[6] Cook, S. A., The complexity of theorem proving procedures, (Proc. 3rd Annual ACM Symposium on Theory on Computing (1971)), 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, (Proc. ACMSIGMOD International Conference on Management of Data (1975)), 203-210
[9] Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972), Plenum: Plenum New York), 85-103 · Zbl 0366.68041
[10] Osborn, S. L., Normal Forms for Relational Data Bases, (Ph.D. Dissertation (1977), University of Waterloo)
[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. 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.