{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:57:21Z","timestamp":1725512241828},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540708803"},{"type":"electronic","value":"9783540708810"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70881-0_12","type":"book-chapter","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T16:07:32Z","timestamp":1186157252000},"page":"112-123","source":"Crossref","is-referenced-by-count":0,"title":["Chase of Recursive Queries"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Fari\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel R.","family":"Luaces","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 R.","family":"Param\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"282","volume":"32","author":"S. Abiteboul","year":"1989","unstructured":"Abiteboul, S.: Boundedness is undecidable for datalog programs with a single recursive rule. Information Processing Letters\u00a032, 282\u2013287 (1989)","journal-title":"Information Processing Letters"},{"key":"12_CR2","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., et al.: Magic sets and other strange ways to implement logic programs. In: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Cambridge, Massachusetts, 24-26 Mar. 1986, pp. 1\u201316 (1986)","DOI":"10.1145\/6012.15399"},{"key":"12_CR4","first-page":"16","volume-title":"Proceedings of ACM SIGMOD International Conference on Management of Data","author":"F. Bancilhon","year":"1986","unstructured":"Bancilhon, F., Ramakrishnan, R.: An amateur\u2019s introduction to recursive query processing strategies. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Washington, DC, May 1986, pp. 16\u201352. ACM Press, New York (1986)"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/B978-0-934613-40-8.50011-7","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"U.S. Chakravarthy","year":"1988","unstructured":"Chakravarthy, U.S., Grant, J., Minker, J.: Foundations of semantic query optimization for deductive databases. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 243\u2013273. Morgan Kaufmann, San Francisco (1988)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S.S., Kanellakis, P.C.: Parallel evaluation of recursive rule queries. In: Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 280\u2013293 (1986)","DOI":"10.1145\/6012.15421"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","first-page":"225","volume-title":"Database Theory - ICDT 2003","author":"V. Tannen","year":"2002","unstructured":"Tannen, V., Deutsch, A.: Reformulation of XML Queries and Constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 225\u2013238. Springer, Heidelberg (2002)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Hern\u00e1ndez, H.J.: Structural query optimization - a uniform framework for semantic query optimization in deductive databases. In: Proc. Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems, pp. 102\u2013114 (1991)","DOI":"10.1145\/113413.113423"},{"key":"12_CR9","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press, New York (1983)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Naughton, J.: Data independent recursion in deductive databases. In: Proc. Fifth ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 267\u2013279 (1986)","DOI":"10.1145\/6012.15420"},{"key":"12_CR11","unstructured":"Naughton, J.F., et al.: Efficient evaluation of right-, left-, and multi-linear rules. ACM SIGMOD RECORD\u00a018(2) (1989), Also published in\/as: 19 ACM SIGMOD Conf. on the Management of Data, Portland, OR, May-Jun. 1989"},{"key":"12_CR12","unstructured":"Param\u00e1, J.R.: Chase of Datalog Programs and its Application to Solve the Functional Dependencies Implication Problem. PhD thesis, Universidade Da Coru\u00f1a, Departmento de Computaci\u00f3n, A Coru\u00f1a, Espa\u00f1a (2001)"},{"key":"12_CR13","unstructured":"Param\u00e1, J.R., et al.: A semantic approach to optimize linear datalog programs. Acta Informatica. In press."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Popa, L., et al.: A chase too far. In: SIGMOD, pp. 273\u2013284 (2000)","DOI":"10.1145\/335191.335421"},{"key":"12_CR15","unstructured":"Ramakrishnan, R., et al.: Coral: A databases programming language. Technical Report TR-CS-90-14, Kansas State University, Department of Computing and Information Sciences (1990)"},{"key":"12_CR16","volume-title":"Principles of Database And Knowledge-Base Systems, vol. 1","author":"J.D. Ullman","year":"1988","unstructured":"Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 1. Computer Science Press, New York (1988)"},{"key":"12_CR17","volume-title":"Principles of Database And Knowledge-Base Systems, vol. 2","author":"J.D. Ullman","year":"1989","unstructured":"Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 2. Computer Science Press, New York (1989)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Decidability and undecidability results for boundedness of linear recursive queries. In: Proc. Seventh ACM SIGACT-SIGMOD Symposium on Principle of Database Systems, pp. 341\u2013351 (1988)","DOI":"10.1145\/308386.308470"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70881-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:51:26Z","timestamp":1558259486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70881-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540708803","9783540708810"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70881-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}