{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:14:22Z","timestamp":1648851262658},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0890-5401(03)00172-x","type":"journal-article","created":{"date-parts":[[2003,10,14]],"date-time":"2003-10-14T17:18:05Z","timestamp":1066151885000},"page":"77-98","source":"Crossref","is-referenced-by-count":0,"title":["Generalization of ZYT-linearizability for bilinear datalog programs"],"prefix":"10.1016","volume":"188","author":[{"given":"Ji-Hoon","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ki-Hyung","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyu-Young","family":"Whang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung-Wan","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0890-5401(03)00172-X_BIB1","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, R. Ramakrishnan, An Amateur\u2019s introduction to recursive query processing strategies, in: Proc. 1986 ACM SIGMOD Int\u2019l Conf. on Management of Data, Washington, DC, May 1986, pp. 16\u201352","DOI":"10.1145\/16894.16859"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB2","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB3","doi-asserted-by":"crossref","unstructured":"A. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational databases, in: Proc. 9th ACM Symp. on the Theory of Computing, 1977, pp. 77\u201390","DOI":"10.1145\/800105.803397"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB4","doi-asserted-by":"crossref","unstructured":"O.M. Duschka, M.R. Genesereth, Answering recursive queries using views, in: Proc. 16th ACM SIGACT\u2013SIGMOD\u2013SIGART Symp. on Principles of Database Systems, Tucson, AZ, USA, May 1997, pp. 109\u2013116","DOI":"10.1145\/263661.263674"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB5","unstructured":"H. Gaifman, H. Mairson, Y. Sagiv, M. Vardi, Undecidable optimization problems for database logic programs, in: Proc. 2nd ACM Symp. on Logic in Computer Science, San Diego, CA, USA, March 1987, pp. 106\u2013115"},{"issue":"3\/4","key":"10.1016\/S0890-5401(03)00172-X_BIB6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0020-0255(96)00160-0","article-title":"Dynamically ordered semi-naive evaluation of recursive queries","volume":"96","author":"Hong","year":"1997","journal-title":"Information Sciences"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB7","doi-asserted-by":"crossref","unstructured":"P.G. Kolaitis, M.Y. Vardi, Conjunctive-query containment and constraint satisfaction, in: Proc. 17th ACM SIGACT\u2013SIGMOD\u2013SIGART Symp. on Principles of Database Systems, Seattle, WA, USA, June 1998, pp. 205\u2013213","DOI":"10.1145\/275487.275511"},{"issue":"1\/2","key":"10.1016\/S0890-5401(03)00172-X_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(94)00186-M","article-title":"Argument reduction by factoring","volume":"146","author":"Naughton","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB9","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(93)90025-R","article-title":"Proof tree transformation theorems and their applications","author":"Ramakrishnan","year":"1993","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB10","doi-asserted-by":"crossref","unstructured":"Y. Sagiv, Optimizing datalog programs, in: Proc. 6th ACM SIGACT\u2013SIGMOD\u2013SIGART Symp. on Principles of Databases Systems, San Diego, CA, USA, March 1987, pp. 349\u2013362","DOI":"10.1145\/28659.28696"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB11","doi-asserted-by":"crossref","unstructured":"Y.P. Saraiya, Linearizing nonlinear recursions in polynomial time, in: Proc. Eighth ACM SIGACT\u2013SIGMOD\u2013SIGART Symp. on Principles of Database Systems, Philadelphia, PA, USA, March 1989, pp. 182\u2013189","DOI":"10.1145\/73721.73740"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB12","doi-asserted-by":"crossref","unstructured":"Y.P. Saraiya, Hard problems for simple logic programs, in: Proc. 1990 ACM SIGMOD Int\u2019l Conf. on Management of Data, Atlantic, NJ, USA, June 1990, pp. 64\u201373","DOI":"10.1145\/93597.93622"},{"issue":"1","key":"10.1016\/S0890-5401(03)00172-X_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcss.1995.1054","article-title":"On the efficiency of transforming database logic programs","volume":"51","author":"Saraiya","year":"1995","journal-title":"Jorunal of Computer and System Sciences"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB14","doi-asserted-by":"crossref","unstructured":"O. Shmueli, Decidability and expressiveness aspects of logic queries, in: Proc. 6th ACM SIGACT\u2013SIGMOD\u2013SIGART Symp. on Principles of Databases Systems, San Diego, CA, USA, March 1987, pp. 237\u2013249","DOI":"10.1145\/28659.28685"},{"issue":"4","key":"10.1016\/S0890-5401(03)00172-X_BIB15","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1145\/219035.219056","article-title":"Space optimazation in deductive databases","volume":"20","author":"Srivastava","year":"1995","journal-title":"ACM Transactions on Database Systems"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB16","volume":"vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB17","volume":"vol. 2","author":"Ullman","year":"1989"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB18","unstructured":"K.-Y. Whang, S.B. Navathe, An extended disjunctive normal form approach for optimizing recursive logic queries in loosely coupled environments, in: Proc. Thirteenth Int\u2019l Conf. on Very Large Data Bases, Brighton, UK, September 1987, pp. 275\u2013287"},{"key":"10.1016\/S0890-5401(03)00172-X_BIB19","doi-asserted-by":"crossref","unstructured":"W. Zhang, C.T. Yu, A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule, in: Proc. 1987 ACM SIGMOD Int\u2019l Conf. on Management of Data, San Francisco, CA, USA, May 1987, pp. 345\u2013356","DOI":"10.1145\/38713.38751"},{"issue":"3","key":"10.1016\/S0890-5401(03)00172-X_BIB20","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/88636.89237","article-title":"A necessary and sufficient condition to linearize doubly recursive programs in logic databases","volume":"15","author":"Zhang","year":"1990","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089054010300172X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089054010300172X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T02:51:03Z","timestamp":1585191063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S089054010300172X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S089054010300172X"],"URL":"https:\/\/doi.org\/10.1016\/s0890-5401(03)00172-x","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}