{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:53Z","timestamp":1725663113855},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540501718"},{"type":"electronic","value":"9783540459439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-50171-1_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:16:46Z","timestamp":1330201006000},"page":"129-143","source":"Crossref","is-referenced-by-count":1,"title":["Idempotent single-predicate horn clauses"],"prefix":"10.1007","author":[{"given":"Peter T.","family":"Wood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto O.","family":"Mendelzon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Atzeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","volume":"8","author":"A.V. Aho","year":"1979","unstructured":"A.V. Aho, Y. Sagiv, and J.D. Ullman, \u201cEquivalences among Relational Expressions,\u201d SIAM J. Comput., vol. 8, no. 2, pp. 218\u2013246, 1979.","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"A.V. Aho and J.D. Ullman, \u201cUniversality of Data Retrieval Languages,\u201d Proc. 6th ACM Symp. on Principles of Programming Languages, pp. 110\u2013120, 1979.","key":"8_CR2","DOI":"10.1145\/567752.567763"},{"doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, \u201cAn Amateur's Introduction to Recursive Query Processing Strategies,\u201d Proc. ACM SIGMOD Conf. on Management of Data, pp. 16\u201352, 1986.","key":"8_CR3","DOI":"10.1145\/16894.16859"},{"issue":"1","key":"8_CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1137\/0213006","volume":"13","author":"C. Beeri","year":"1984","unstructured":"C. Beeri and M.Y. Vardi, \u201cFormal Systems for Tuple and Equality Generating Dependencies,\u201d SIAM J. Comput., vol. 13, no. 1, pp. 76\u201398, 1984.","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"A.K. Chandra and P.M. Merlin, \u201cOptimal Implementation of Conjunctive Queries in Relational Data Bases,\u201d Proc. 9th ACM Symp. on Theory of Computing, pp. 77\u201390, 1977.","key":"8_CR5","DOI":"10.1145\/800105.803397"},{"key":"8_CR6","first-page":"65","volume-title":"Data Base Systems","author":"E. F. Codd","year":"1972","unstructured":"E. F. Codd, \u201cRelational Completeness of Data Base Sublanguages,\u201d in Data Base Systems, ed. R. Rustin, pp. 65\u201398, Prentice-Hall, Englewood Cliffs, N. J, 1972."},{"doi-asserted-by":"crossref","unstructured":"S. Cosmadakis and P. Kanellakis, \u201cParallel Evaluation of Recursive Rule Queries,\u201d Proc. 5th ACM SIGACT\u2014SIGMOD Symp. on Principles of Database Systems, pp. 280\u2013293, 1986.","key":"8_CR7","DOI":"10.1145\/6012.15421"},{"doi-asserted-by":"crossref","unstructured":"I.F. Cruz, A.O. Mendelzon, and P.T. Wood, \u201cA Graphical Query Language Supporting Recursion,\u201d Proc. ACM SIGMOD Conf. on Management of Data, pp. 323\u2013330, 1987.","key":"8_CR8","DOI":"10.1145\/38713.38749"},{"unstructured":"Y.E. Ioannidis, \u201cA Time Bound on the Materialization of Some Recursively Defined Views,\u201d Proc. 11th Int. Conf. on Very Large Data Bases, pp. 219\u2013226, 1985.","key":"8_CR9"},{"doi-asserted-by":"crossref","unstructured":"J. Naughton, \u201cData Independent Recursion in Deductive Databases,\u201d Proc. 5th ACM SIGACT\u2014SIGMOD Symp. on Principles of Database Systems, pp. 267\u2013279, 1986.","key":"8_CR10","DOI":"10.1145\/6012.15420"},{"doi-asserted-by":"crossref","unstructured":"J. Naughton and Y. Sagiv, \u201cA Decidable Class of Bounded Recursions,\u201d Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pp. 227\u2013236, 1987.","key":"8_CR11","DOI":"10.1145\/28659.28684"},{"doi-asserted-by":"crossref","unstructured":"Y. Sagiv, \u201cOn Computing Restricted Projections of Representative Instances,\u201d Proc. 4th ACM SIGACT\u2014SIGMOD Symp. on Principles of Database Systems, pp. 171\u2013180, 1985.","key":"8_CR12","DOI":"10.1145\/325405.325427"},{"issue":"1","key":"8_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0217001","volume":"17","author":"Y. Sagiv","year":"1988","unstructured":"Y. Sagiv, \u201cOn Bounded Database Schemes and Bounded Horn-Clause Programs,\u201d SIAM J. Comput., vol. 17, no. 1, pp. 1\u201322, 1988.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"8_CR14","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1145\/322217.322221","volume":"27","author":"Y. Sagiv","year":"1980","unstructured":"Y. Sagiv and M. Yannakakis, \u201cEquivalence among Relational Expressions with the Union and Difference Operators,\u201d J. ACM, vol. 27, no. 4, pp. 633\u2013655, 1980.","journal-title":"J. ACM"},{"unstructured":"J.D. Ullman, Principles of Database Systems, Computer Science Press, Potomac, Md., 1983.","key":"8_CR15"}],"container-title":["Lecture Notes in Computer Science","ICDT '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50171-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:54:21Z","timestamp":1619571261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50171-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540501718","9783540459439"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-50171-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}