{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:49:03Z","timestamp":1749221343793},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620648"},{"type":"electronic","value":"9783540496373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62064-8_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:33:29Z","timestamp":1330295609000},"page":"433-444","source":"Crossref","is-referenced-by-count":3,"title":["On transformations into linear database logic programs"],"prefix":"10.1007","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[]},{"given":"Manolis","family":"Gergatsoulis","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Katzouraki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"F. Afrati and S. Cosmadakis. Expressiveness of restricted recursive queries. In Proc. 21st ACM Symp. on Theory of Computing, pages 113\u2013126, 1989.","DOI":"10.1145\/73007.73018"},{"issue":"2","key":"36_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jcss.1995.1060","volume":"51","author":"F. Afrati","year":"1995","unstructured":"F. Afrati, S. Cosmadakis, and M. Yannakakis. On datalog vs. polynomial time. J. Computer and Systems Sciences, 51(2):117\u2013196, 1995.","journal-title":"J. Computer and Systems Sciences"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"F. Afrati, S. Cosmadakis, and M. Yannakakis. On datalog vs. polynomial time. In Proc. 10th ACM Symp. on Principles of Database Systems, pages 113\u2013126, 1991.","DOI":"10.1145\/113413.113415"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"F. Afrati and C. H. Papadimitriou. The parallel complexity of simple chain queries. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 210\u2013213, 1987.","DOI":"10.1145\/28659.28682"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proc. ACM Conf. on Management of Data, pages 16\u201352, 1986.","DOI":"10.1145\/16894.16859"},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","volume":"9","author":"S. A. Cook","year":"1974","unstructured":"S. A. Cook. An observation on time-storage trade off. J. Computer and System Sciences, 9:308\u2013316, 1974.","journal-title":"J. Computer and System Sciences"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"S. S. Cosmadakis and P. C. Kanellakis. Parallel evaluation of recursive rule queries. In Proc. 5th ACM Symp. on Principles of Database Systems, pages 280\u2013293, 1986.","DOI":"10.1145\/6012.15421"},{"key":"36_CR8","unstructured":"M. Gergatsoulis. Logic program transformations: Rules and application strategies. PhD thesis, Dept. of Computer Science, University of Athens, 1994. (In Greek)."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"M. Gergatsoulis and M. Katzouraki. Unfold\/fold transformations for definite clause programs. In Programming Language Implementation and Logic Programming (PLILP'94), LNCS 844, Pages 340\u2013354, Spinger-Verlang, 1994.","DOI":"10.1007\/3-540-58402-1_24"},{"key":"36_CR10","unstructured":"Y. E. Ioannidis. A time bound on the materialization of some recursively defined views. In Proc. 11th Int'l Conf. on Very Large Data Bases, pages 219\u2013226, 1985."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"J-L. Lasser, M. J. Maher, and K. Marriott. Unification revisited. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587\u2013625, Morgan Kaufmann Publishers,Inc., 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"J. F. Naughton. Data independent recursion in deductive databases. In Proc. 5th ACM Symp. on Principles of Database Systems, pages 267\u2013279, 1986.","DOI":"10.1145\/6012.15420"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"J. F. Naughton and Y. Sagiv. A decidable class of bounded recursions. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 227\u2013236, 1987.","DOI":"10.1145\/28659.28684"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19\/20","author":"A. Pettorossi","year":"1994","unstructured":"A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19\/20:261\u2013320, May\/July 1994.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"36_CR16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0743-1066(93)90025-C","volume":"16","author":"M. Proietti","year":"1993","unstructured":"M. Proietti and A. Pettorossi. The loop absorption and the generalization strategies for the development of logic programs and partial deduction. The Journal of Logic Programming, 16(1&2):123\u2013162, May 1993.","journal-title":"The Journal of Logic Programming"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"M. Proietti and A. Pettorossi. Synthesis of eureka predicates for developing logic programs. In LNCS no. 432, Proc. of the 3rd European Symposium on Programming, pages 306\u2013325, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52592-0_71"},{"key":"36_CR18","unstructured":"H. Tamaki and T. Sato. Unfold\/fold transformations of logic programs. In Second International Conference on Logic Programming, pages 127\u2013138, 1984."},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"J. D. Ullman and A. Van Gelder. Parallel complexity of logical query programs. In Proc. 27th IEEE Symp. on Foundations of Comp. Sci., pages 438\u2013454, 1986.","DOI":"10.1109\/SFCS.1986.40"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62064-8_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:52Z","timestamp":1605647512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62064-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620648","9783540496373"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-62064-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}