On the number of candidate keys
- 31 October 1978
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 7 (6), 266-269
- https://doi.org/10.1016/0020-0190(78)90013-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the complexity of finding the set of candidate keys for a given set of functional dependenciesInformation Processing Letters, 1976
- Decomposition of a Data Base and the Theory of Boolean Switching FunctionsIBM Journal of Research and Development, 1973
- Normalized data base structurePublished by Association for Computing Machinery (ACM) ,1971
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928