{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T08:49:44Z","timestamp":1648889384542},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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 Sciences"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0020-0255(93)90043-l","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"157-183","source":"Crossref","is-referenced-by-count":0,"title":["Compilation and evaluation of linear mutual recursions"],"prefix":"10.1016","volume":"69","author":[{"given":"Jiawei","family":"Han","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(93)90043-L_BIB1","series-title":"Proceedings of the 5th ACM Symposium on Principles of Database Systems","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0020-0255(93)90043-L_BIB2","series-title":"Proceedings of the 1986 ACM-SIGMOD Conference Management of Data","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0020-0255(93)90043-L_BIB3","series-title":"Proceedings of the 6th ACM Symposium on Principles of Database Systems","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"key":"10.1016\/0020-0255(93)90043-L_BIB4","series-title":"Proceedings of the 6th ACM Symposium on Principles of Database Systems","article-title":"Bounds on the propagation of selection into logic programs","author":"Beeri","year":"1987"},{"key":"10.1016\/0020-0255(93)90043-L_BIB5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/69.87959","article-title":"Asynchronous chain recursions","volume":"1","author":"Han","year":"1989","journal-title":"IEEE Trans. Knowledge Data Engrg"},{"key":"10.1016\/0020-0255(93)90043-L_BIB6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1111\/j.1467-8640.1989.tb00312.x","article-title":"Compiling general linear recursions by variable connection graph analysis","volume":"5","author":"Han","year":"1989","journal-title":"Comput. Intell."},{"key":"10.1016\/0020-0255(93)90043-L_BIB7","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/32.106985","article-title":"Efficient evaluation of multiple linear recursions","volume":"17","author":"Han","year":"1991","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0255(93)90043-L_BIB8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On compiling queries in recursive first-order databases","volume":"31","author":"Henschen","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0020-0255(93)90043-L_BIB9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/103516.103521","article-title":"Towards an algebraic theory of recursion","volume":"38","author":"Ioannidis","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0020-0255(93)90043-L_BIB10","series-title":"A Logical Data Language for Data and Knowledge Bases","author":"Naqvi","year":"1989"},{"key":"10.1016\/0020-0255(93)90043-L_BIB11","series-title":"Proceedings of the 6th ACM Symposium on Principles of Database Systems","article-title":"One-sided recursions","author":"Naughton","year":"1987"},{"key":"10.1016\/0020-0255(93)90043-L_BIB12","series-title":"Proceedings of the 1988 ACMSIGMOD Conference on Management of Data","article-title":"Compiling separable recursions","author":"Naughton","year":"1988"},{"key":"10.1016\/0020-0255(93)90043-L_BIB13","series-title":"The Art of Prolog","author":"Sterling","year":"1986"},{"key":"10.1016\/0020-0255(93)90043-L_BIB14_1","volume":"Vol. 1","author":"Ullman","year":"1989"},{"key":"10.1016\/0020-0255(93)90043-L_BIB14_2","volume":"Vol. 2","author":"Ullman","year":"1989"},{"key":"10.1016\/0020-0255(93)90043-L_BIB15","series-title":"Proceedings of the 1st International Conference on Expert Database Systems","article-title":"Recursive axioms in deductive databases: the query\/subquery approach","author":"Vieille","year":"1986"},{"key":"10.1016\/0020-0255(93)90043-L_BIB16","unstructured":"N. Zhuang and L. J. Henschen, Compilation of uniform linear recursive rule clusters, unpublished manuscript."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390043L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390043L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:58Z","timestamp":1552915678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559390043L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["002002559390043L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(93)90043-l","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}