{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T02:14:52Z","timestamp":1683944092342},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7533,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0166-218x(92)90033-7","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:30:20Z","timestamp":1034274620000},"page":"265-282","source":"Crossref","is-referenced-by-count":15,"title":["The number of keys in relational and nested relational databases"],"prefix":"10.1016","volume":"40","author":[{"given":"B.","family":"Thalheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90033-7_BIB1","unstructured":"S. Al-Fedaghi and B. Thalheim, Logical foundations for two-tuple constraints in the relational database model, to appear."},{"key":"10.1016\/0166-218X(92)90033-7_BIB2","unstructured":"S. Al-Fedaghi and B. Thalheim, Fundamentals of the database theory \u2014 The key concept, to appear."},{"key":"10.1016\/0166-218X(92)90033-7_BIB3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2422.322414","article-title":"On the structure of Armstrong relations for functional dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90033-7_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(79)90064-5","article-title":"Contribution to the theory of data base relations","volume":"27","author":"Bekessy","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90033-7_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(80)90108-9","article-title":"On the number of maximal dependencies in a data base relation of fixed order","volume":"30","author":"Bekessy","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90033-7_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/362384.362685","article-title":"A relational model for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)90033-7_BIB7","series-title":"Relational Database Systems","author":"Delobel","year":"1985"},{"key":"10.1016\/0166-218X(92)90033-7_BIB8","first-page":"247","article-title":"On the equivalence of candidate keys with Sperner sets","volume":"4","author":"Demetrovics","year":"1979","journal-title":"Acta Cybernet."},{"key":"10.1016\/0166-218X(92)90033-7_BIB9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1137\/0601012","article-title":"Candidate keys and antichains","volume":"1","author":"Demetrovics","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)90033-7_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(85)80003-2","article-title":"Minimum matrix representation of closure operations","volume":"11","author":"Demetrovics","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90033-7_BIB11","series-title":"Algebra, Combinatorics and Logic in Computer Science","first-page":"331","article-title":"Combinatorial problems of database models","volume":"42","author":"Demetrovics","year":"1983"},{"key":"10.1016\/0166-218X(92)90033-7_BIB12","article-title":"Describing keys and prime attributes by antikeys","author":"Demetrovics","year":"1989","journal-title":"Manuscript"},{"key":"10.1016\/0166-218X(92)90033-7_BIB13","first-page":"203","article-title":"Finding candidate keys for relational databases","author":"Fadous","year":"1975","journal-title":"Proceedings 1st ACM SIGMOD Conference, San Jose, CA"},{"key":"10.1016\/0166-218X(92)90033-7_BIB14","series-title":"Res. Rept. RJ 3440(40926) 4\/5\/82","article-title":"Armstrong databases","author":"Fagin","year":"1982"},{"key":"10.1016\/0166-218X(92)90033-7_BIB15","first-page":"495","article-title":"Determining the normalization level of a relation on the basis of Armstrong's axioms","volume":"3","author":"Fernandez","year":"1984","journal-title":"Comput. Artificial Intelligence"},{"key":"10.1016\/0166-218X(92)90033-7_BIB16","article-title":"Contribution to the theory of relational databases","author":"Thuan","year":"1986","journal-title":"Manuscript"},{"key":"10.1016\/0166-218X(92)90033-7_BIB17","first-page":"99","article-title":"Some results about keys of relational schemes","volume":"7","author":"Thuan","year":"1984","journal-title":"Acta Cybernet."},{"key":"10.1016\/0166-218X(92)90033-7_BIB18","first-page":"398","article-title":"Semantic aspects of data dependencies and their application to relational database design","author":"Kambayashi","year":"1979","journal-title":"Proceedings COMPSAC"},{"key":"10.1016\/0166-218X(92)90033-7_BIB19","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/BF01216798","article-title":"Elementarer Beweis einiger asymptodischer Formeln der additiven Zahlen-theorie","volume":"24","author":"Knopp","year":"1925","journal-title":"Math. Z."},{"key":"10.1016\/0166-218X(92)90033-7_BIB20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(78)90009-0","article-title":"Candidate keys for relations","volume":"17","author":"Lucchesi","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(92)90033-7_BIB21","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(86)90015-2","article-title":"Design by example: an application of Armstrong relations","volume":"33","author":"Mannila","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(92)90033-7_BIB22","first-page":"569","article-title":"Local limit theorems and asymtotical partitions for summation of independent stochastic variables","volume":"6","author":"Mitalauskas","year":"1966","journal-title":"Litovsk. Mat. Sb."},{"key":"10.1016\/0166-218X(92)90033-7_BIB23","series-title":"Structures in the Relational Database Model","author":"Paredaens","year":"1989"},{"key":"10.1016\/0166-218X(92)90033-7_BIB24","first-page":"267","article-title":"On the number of minimal keys in relational databases on nonuniform domains","volume":"8","author":"Selesnjew","year":"1988","journal-title":"Acta Cybernet."},{"key":"10.1016\/0166-218X(92)90033-7_BIB25","first-page":"115","article-title":"A method for helping discover the dependencies of a relation","volume":"Vol. 1","author":"Silva","year":"1981"},{"key":"10.1016\/0166-218X(92)90033-7_BIB26","first-page":"23","article-title":"Funktionale Abh\u00e4ngigkeiten in relationalen Datenstrukturen","volume":"21","author":"Thalheim","year":"1985","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/0166-218X(92)90033-7_BIB27","series-title":"Dissertation B","article-title":"Abh\u00e4ngigkeiten in Relationen","author":"Thalheim","year":"1985"},{"key":"10.1016\/0166-218X(92)90033-7_BIB28","article-title":"Moderne Aspekte der Theorie der relationalen Datenbanken. X. Nullwerte in relationalen Datenbanken \u2014 eine \u00dcbersicht","author":"Thalheim","year":"1987","journal-title":"Manuscript"},{"key":"10.1016\/0166-218X(92)90033-7_BIB29","series-title":"Dependencies in Relational Databases","author":"Thalheim","year":"1987"},{"key":"10.1016\/0166-218X(92)90033-7_BIB30","series-title":"FCT-87-Conference","first-page":"448","article-title":"On the number of keys in relational databases","volume":"278","author":"Thalheim","year":"1987"},{"key":"10.1016\/0166-218X(92)90033-7_BIB31_1","first-page":"1","article-title":"On semantic issues connected with keys in relational databases permitting null values","volume":"25","author":"Thalheim","year":"1989","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/0166-218X(92)90033-7_BIB31_2","first-page":"11","article-title":"On semantic issues connected with keys in relational databases permitting null values","volume":"25","author":"Thalheim","year":"1989","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/0166-218X(92)90033-7_BIB32","article-title":"A note on minimum matrix representation of Sperner systems","author":"Wu","year":"1989","journal-title":"Manuscript"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T15:27:42Z","timestamp":1555169262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92900337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0166218X92900337"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90033-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}