{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:45Z","timestamp":1759683765138},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1978,10,1]],"date-time":"1978-10-01T00:00:00Z","timestamp":276048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1978,10]]},"DOI":"10.1016\/0020-0190(78)90013-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"266-269","source":"Crossref","is-referenced-by-count":14,"title":["On the number of candidate keys"],"prefix":"10.1016","volume":"7","author":[{"given":"J\u00e1nos","family":"Demetrovics","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(78)90013-3_BIB1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model of data for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(78)90013-3_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/1734714.1734716","article-title":"Normalized data base structure: A brief tutorial","author":"Codd","year":"1971","journal-title":"Proc. ACM-SIGFIDET Workshop on Data Description, Access and Control"},{"key":"10.1016\/0020-0190(78)90013-3_BIB3","series-title":"Courant Computer Science Symposia 6: Data Base System","first-page":"33","article-title":"Further normalization of the data base relational model","author":"Codd","year":"1971"},{"key":"10.1016\/0020-0190(78)90013-3_BIB4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1147\/rd.175.0374","article-title":"Decomposition of a data base and the theory of boolean switching functions","volume":"17","author":"Delobel","year":"1973","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0020-0190(78)90013-3_BIB5","first-page":"203","article-title":"Finding candidate keys for relational data bases","author":"Fadous","year":"1975","journal-title":"Proc. ACM SIGMOD"},{"issue":"4","key":"10.1016\/0020-0190(78)90013-3_BIB6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0020-0190(76)90003-X","article-title":"On the complexity of finding the set of candidate keys for a given set of functional dependencies","volume":"5","author":"Yu","year":"1976","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0190(78)90013-3_BIB7","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","article-title":"Eine Satz uber Untermengen einer endlichen Menge","volume":"27","author":"Sperner","year":"1928","journal-title":"Math. Z."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019078900133?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019078900133?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:28:00Z","timestamp":1555072080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019078900133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,10]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1978,10]]}},"alternative-id":["0020019078900133"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(78)90013-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1978,10]]}}}