{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:14:59Z","timestamp":1649063699385},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1976,10,1]],"date-time":"1976-10-01T00:00:00Z","timestamp":212976000000},"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":[[1976,10]]},"DOI":"10.1016\/0020-0190(76)90003-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"100-101","source":"Crossref","is-referenced-by-count":11,"title":["On the complexity of finding the set of candidate keys for a given set of functional dependencies"],"prefix":"10.1016","volume":"5","author":[{"given":"C.T.","family":"Yu","sequence":"first","affiliation":[]},{"given":"D.T.","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(76)90003-X_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":"CACM"},{"key":"10.1016\/0020-0190(76)90003-X_BIB2","doi-asserted-by":"crossref","unstructured":"E.F. Codd, Normalized data base structure: A brief tutorial, Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control.","DOI":"10.1145\/1734714.1734716"},{"key":"10.1016\/0020-0190(76)90003-X_BIB3","series-title":"Courant Computer Science Symposia 6 \u201cData Base Systems\u201d","first-page":"33","article-title":"Further normalization of the data base relational model","author":"Codd","year":"1971"},{"key":"10.1016\/0020-0190(76)90003-X_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. & Devel."},{"key":"10.1016\/0020-0190(76)90003-X_BIB5","unstructured":"R. Fadous, J. Forsyth, Finding candidate keys for relational data bases, Proc. 1975 ACM SIGMOD, pp. 203-210."},{"key":"10.1016\/0020-0190(76)90003-X_BIB6","first-page":"580","article-title":"Dependency structures of data base relationships","volume":"74","author":"Armstrong","year":"1974"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001907690003X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001907690003X?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:51:07Z","timestamp":1555073467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001907690003X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,10]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976,10]]}},"alternative-id":["002001907690003X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(76)90003-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1976,10]]}}}