{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:45:41Z","timestamp":1726454741761},"reference-count":17,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780127082400"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1016\/b978-0-12-708240-0.50012-5","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T01:33:40Z","timestamp":1404178420000},"page":"181-206","source":"Crossref","is-referenced-by-count":5,"title":["On Datalog Linearization of Chain Queries"],"prefix":"10.1016","author":[{"given":"Guozhu","family":"Dong","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib1","doi-asserted-by":"crossref","unstructured":"F. Afrati and S.S. Cosmadakis. Expressiveness of restricted recursive queries. In Proc. ACM SIGACT Symp. on the Theory of Computing, pages 113\u2013126, 1989.","DOI":"10.1145\/73007.73018"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Information and Control"},{"year":"1991","series-title":"On decomposing chain datalog programs into P (left-)linear sequences of chain rules","author":"Dong","key":"10.1016\/B978-0-12-708240-0.50012-5_bib3"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib4","first-page":"33","article-title":"Independence of AFL operations","author":"Greibach","year":"1969","journal-title":"Memoirs of the American Mathematical Society"},{"year":"1966","series-title":"The Mathematical Theory of Context-Free Languages.","author":"Ginsburg","key":"10.1016\/B978-0-12-708240-0.50012-5_bib5"},{"year":"1975","series-title":"Algebraic and Automata-Theoretics Properties of Formal Languages.","author":"Ginsburg","key":"10.1016\/B978-0-12-708240-0.50012-5_bib6"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib7","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","article-title":"Derivation-bounded languages","volume":"2","author":"Ginsburg","year":"1968","journal-title":"Journal of Computer and System Sciences"},{"year":"1978","series-title":"Introduction to Formal Language Theory.","author":"Harrison","key":"10.1016\/B978-0-12-708240-0.50012-5_bib8"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib9","unstructured":"Y. E. Ioannidis and E. Wong. Transforming nonlinear recursion to linear recursion. In L. Kerschberg, editor, Proceedings of Second International Conference on Expert Database Systems, pages 187\u2013207, 1988."},{"issue":"4","key":"10.1016\/B978-0-12-708240-0.50012-5_bib10","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/322033.322037","article-title":"Log space recognition and translation of perenthesis languages","volume":"24","author":"Lynch","year":"1977","journal-title":"Journal of the ACM"},{"issue":"1","key":"10.1016\/B978-0-12-708240-0.50012-5_bib11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","article-title":"Programmed grammars and classes of formal languages","volume":"16","author":"Rosenkratz","year":"1969","journal-title":"Journal of the ACM"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0019-9958(72)90205-7","article-title":"Springsteel. Language recognition by marking automata","volume":"20","author":"Ritchie","year":"1972","journal-title":"Information and Control"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib13","doi-asserted-by":"crossref","unstructured":"R. Ramakrishnan, Y. Sagiv, J. D. Ullman, and M. Y. Vardi. Proof-tree transformations theorems and their applications. In Proc. ACM Symposium on Principles of Database Systems, pages 172\u2013181, 1989.","DOI":"10.1145\/73721.73739"},{"year":"1973","series-title":"Formal Languages.","author":"Salomaa","key":"10.1016\/B978-0-12-708240-0.50012-5_bib14"},{"key":"10.1016\/B978-0-12-708240-0.50012-5_bib15","doi-asserted-by":"crossref","unstructured":"Y. P. Saraiya. Linearizing nonlinear recursions in polynomial time. In Proc. ACM Symposium on Principles of Database Systems, pages 182\u2013189, 1989.","DOI":"10.1145\/73721.73740"},{"volume":"Vol II","year":"1989","author":"Ullman","key":"10.1016\/B978-0-12-708240-0.50012-5_bib16"},{"issue":"3","key":"10.1016\/B978-0-12-708240-0.50012-5_bib17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/88636.89237","article-title":"Necessary and sufficient conditions to linearize doubly recursive programs in logic databases","volume":"15","author":"Zhang","year":"1990","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Theoretical Studies in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780127082400500125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780127082400500125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T02:11:38Z","timestamp":1565575898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780127082400500125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9780127082400"],"references-count":17,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-708240-0.50012-5","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}