Candidate keys for relations
- 1 October 1978
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 17 (2) , 270-279
- https://doi.org/10.1016/0022-0000(78)90009-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Decomposition of a Data Base and the Theory of Boolean Switching FunctionsIBM Journal of Research and Development, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- Connectivity in GraphsPublished by University of Toronto Press Inc. (UTPress) ,1966