{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:37:44Z","timestamp":1703187464060},"reference-count":11,"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)90032-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"245-264","source":"Crossref","is-referenced-by-count":8,"title":["Minimizing restricted-fanout queries"],"prefix":"10.1016","volume":"40","author":[{"given":"Yehoshua","family":"Sagiv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yatin","family":"Saraiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90032-6_BIB1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalences among relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90032-6_BIB2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/320107.320112","article-title":"Efficient optimization of a class of relational expressions","volume":"4","author":"Aho","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0166-218X(92)90032-6_BIB3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/800105.803397","article-title":"Optimal implementation of conjunctive queries in relational databases","author":"Chandra","year":"1977","journal-title":"Proceedings Ninth Annual ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(92)90032-6_BIB4","series-title":"Data Base Systems","first-page":"65","article-title":"Relational completeness of data base sublanguages","author":"Codd","year":"1972"},{"key":"10.1016\/0166-218X(92)90032-6_BIB5","series-title":"Proceedings of FST&TCS","article-title":"An O(n2) algorithm for fanout-free query optimization","volume":"327","author":"Dublish","year":"1988"},{"key":"10.1016\/0166-218X(92)90032-6_BIB6","series-title":"Advances in Computing and Information, Proceedings of the International Conference on Computing and Information, ICCI '90","first-page":"72","article-title":"Finding two-tree-factor elements of tableau-defined monoids in time O(n3)","author":"Heinz","year":"1990"},{"key":"10.1016\/0166-218X(92)90032-6_BIB7","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1137\/0212042","article-title":"Optimizing conjunctive queries that contain untyped variables","volume":"12","author":"Johnson","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90032-6_BIB8","series-title":"Ph.D. thesis","article-title":"A study of complexity of some optimization and design issues in relational database systems","author":"Murthy","year":"1985"},{"key":"10.1016\/0166-218X(92)90032-6_BIB9","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1137\/0212020","article-title":"Quadratic algorithms for minimizing joins in restricted relational expressions","volume":"12","author":"Sagiv","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90032-6_BIB10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1145\/322217.322221","article-title":"Equivalence among relational expressions with the union and difference operators","volume":"27","author":"Sagiv","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90032-6_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/298514.298551","article-title":"Polynomial-time program transformations in deductive databases","author":"Saraiya","year":"1990","journal-title":"Proceedings Ninth ACM Symposium on Principles of Database Systems"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900326?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900326?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:43Z","timestamp":1555190623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92900326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0166218X92900326"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90032-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}