{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:27:29Z","timestamp":1742387249606},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0022-0000(93)90025-r","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"222-248","source":"Crossref","is-referenced-by-count":8,"title":["Logical query optimization by proof-tree transformation"],"prefix":"10.1016","volume":"47","author":[{"given":"Raghu","family":"Ramakrishnan","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90025-R_BIB1","series-title":"Proceedings, Twenty-First Annual ACM Symposium on the Theory of Computing","first-page":"113","article-title":"Expressiveness of restricted recursive queries","author":"Afrati","year":"1989"},{"key":"10.1016\/0022-0000(93)90025-R_BIB2","series-title":"Proceedings, Fifth ACM Symposium on Principles of Database Systems","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0022-0000(93)90025-R_BIB3","unstructured":"A. K. Chandra, H. R. Lewis, and J. A. Makowsky,\u201cEmbedded Implicational Dependencies and their Inference Problem,\u201d"},{"key":"10.1016\/0022-0000(93)90025-R_BIB4","series-title":"Proc. Thirteenth Annual ACM Symposium on the Theory of Computing, pp. 342\u2013354.","first-page":"77","article-title":"Optimal implementation of conjunctive queries in relational databases","author":"Chandra","year":"1977"},{"key":"10.1016\/0022-0000(93)90025-R_BIB5","series-title":"Proceedings, Fifth ACM Symposium on Principles of Database Systems","first-page":"280","article-title":"Parallel evaluation of recursive rule queries","author":"Cosmadakis","year":"1986"},{"key":"10.1016\/0022-0000(93)90025-R_BIB6","series-title":"Proceedings, Second ACM Symp. on Logic in Computer Science","first-page":"106","article-title":"Undecidable optimization problems for database logic programs","author":"Gaifman","year":"1987"},{"key":"10.1016\/0022-0000(93)90025-R_BIB7","article-title":"Detecting an Eliminating Redundant Deviations in Deductive Darabase Systems","author":"Helm","year":"1988","journal-title":"IBM T. J. Watson Research Center Report RC 14244 (# 63767)"},{"key":"10.1016\/0022-0000(93)90025-R_BIB8","series-title":"Proceedings, Second Intl. Conf. on Expert Database Systems","first-page":"187","article-title":"Transforming nonlinear recursion to linear recursion","author":"Ioannidis","year":"1988"},{"issue":"Nos. 3-2","key":"10.1016\/0022-0000(93)90025-R_BIB9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0743-1066(92)90012-R","article-title":"Commutativity and Its Role in the Processing of Linear Recursion","volume":"14","author":"Ioannidis","year":"1992","journal-title":"Logic Programming"},{"key":"10.1016\/0022-0000(93)90025-R_BIB10","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"545","article-title":"Logic programming and parallel complexity","author":"Kanellakis","year":"1988"},{"key":"10.1016\/0022-0000(93)90025-R_BIB11","article-title":"Semantics of Logic Programs","author":"Maher","year":"1985"},{"key":"10.1016\/0022-0000(93)90025-R_BIB12","series-title":"ACM SIGMOD International Conf. on Management of Data","first-page":"312","article-title":"Compiling separable recursions","author":"Naughton","year":"1988"},{"key":"10.1016\/0022-0000(93)90025-R_BIB13","series-title":"Proceedings, Fifth ACM Symposium on Principles of Database Systems","first-page":"16","article-title":"On the implementation of a simple class of logic queries for databases","author":"Sacca","year":"1986"},{"key":"10.1016\/0022-0000(93)90025-R_BIB14","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"659","article-title":"Optimising datalog programs","author":"Sagiv","year":"1987"},{"key":"10.1016\/0022-0000(93)90025-R_BIB15","series-title":"Proceedings, Eighth ACM Symposium on Principles of Database Systems","first-page":"182","article-title":"Linearizing nonlinear recursions in polynomial time","author":"Saraiya","year":"1989"},{"key":"10.1016\/0022-0000(93)90025-R_BIB16","series-title":"ACM SIGMOD International Conf. on Management of Data","first-page":"64","article-title":"Hard problems for simple logic programs","author":"Saraiya","year":"1990"},{"key":"10.1016\/0022-0000(93)90025-R_BIB17","series-title":"Proceedings, Sixth ACM Symposium on Principles of Database Systems","first-page":"237","article-title":"Decidability and expressiveness aspects of logic queries","author":"Shmueli","year":"1987"},{"key":"10.1016\/0022-0000(93)90025-R_BIB18","volume":"Vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/0022-0000(93)90025-R_BIB19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01762108","article-title":"Parallel complexity of logical query programs","volume":"3","author":"Ullman","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(93)90025-R_BIB20","series-title":"A necessary and sufficient condition to linearize doubly recursive programs in logic databases","author":"Zhang","year":"1988"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390025R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390025R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:57:56Z","timestamp":1550307476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390025R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002200009390025R"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90025-r","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}