{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:40:27Z","timestamp":1649025627549},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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 Systems"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0306-4379(92)90029-m","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"511-515","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of finding bounds for projection cardinalities in relational databases"],"prefix":"10.1016","volume":"17","author":[{"given":"Paolo","family":"Ciaccia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Maio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(92)90029-M_BIB1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/62032.62034","article-title":"On estimating the cardinality of the projection of a database relation","volume":"14","author":"Ahad","year":"1989","journal-title":"Acm Tods"},{"key":"10.1016\/0306-4379(92)90029-M_BIB2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(82)90042-4","article-title":"A statistical model for estimating the number of records in a relational database","volume":"15","author":"Cheung","year":"1982","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0306-4379(92)90029-M_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0306-4379(84)90005-X","article-title":"On the size of projections: a generating function approach","volume":"9","author":"Gardy","year":"1984","journal-title":"Information Systems"},{"key":"10.1016\/0306-4379(92)90029-M_BIB4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/0306-4379(90)90031-J","article-title":"Estimating the size of relational SP\u0398 J operation results: an analytical approach","volume":"15","author":"Mostardi","year":"1990","journal-title":"Information Systems"},{"key":"10.1016\/0306-4379(92)90029-M_BIB5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","article-title":"Computational problems related to the design of normal form relational schemas","volume":"4","author":"Beeri","year":"1979","journal-title":"Acm Tods"},{"key":"10.1016\/0306-4379(92)90029-M_BIB6","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. Syst. Sci."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643799290029M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030643799290029M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:55:48Z","timestamp":1552611348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030643799290029M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["030643799290029M"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(92)90029-m","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}