{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:28:18Z","timestamp":1752550098484},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560395"},{"type":"electronic","value":"9783540473602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56039-4_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:55:06Z","timestamp":1330235706000},"page":"282-296","source":"Crossref","is-referenced-by-count":25,"title":["Incremental evaluation of Datalog queries"],"prefix":"10.1007","author":[{"given":"Guozhu","family":"Dong","sequence":"first","affiliation":[]},{"given":"Rodney","family":"Topor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"19_CR1","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":"19_CR2","doi-asserted-by":"crossref","unstructured":"K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89\u2013148. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"K. R. Apt and J.-M. Pugin. Maintenance of stratified databases viewed as a belief revision system. In Proc. Sixth ACM Symp. on Principles of Database Systems, pages 136\u2013145, 1987.","DOI":"10.1145\/28659.28674"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"F. Bancilhon. Naive evaluation of recursively defined relations. In M. L. Brodie and J. Mylopoulos, editors, On Knowledge Base Management Systems: Integrating Artificial Intelligence and Database Technologies. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-4980-1_17"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. Fifth ACM Symp. on Principles of Database Systems, pages 1\u201315, 1986.","DOI":"10.1145\/6012.15399"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"F. Bry, H. Decker and R. Manthey. A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases. In Proc. First Int. Conf. on Extending Database Technology, pages 488\u2013505, 1988.","DOI":"10.1007\/3-540-19074-0_69"},{"key":"19_CR7","unstructured":"A.L. Buchsbaum, P.C. Kanellakis and J.S. Vitter. A data structure for arc insertion and regular path finding. In Proc. ACM-SIAM Symp. on Discrete Algorithms, 1990."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"G. Dong. On datalog linearization of chain queries. In J.D. Ullman, editor, Theoretical Studies in Computer Science, pages 181-206. Academic Press, 1991.","DOI":"10.1016\/B978-0-12-708240-0.50012-5"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"G. Dong. Datalog expressiveness of chain queries: Grammar tools and characterizations. In Proc. Eleventh ACM Symp. on Principles of Database Systems, pages 81\u201390, 1992.","DOI":"10.1145\/137097.137113"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"G. G. Hillerbrand, P. C. Kanellakis, H, G. Mairson, and M. Y. Vardi. Tools for Datalog boundedness. In Proc. Tenth ACM Symp. on Principles of Database Systems, pages 1\u201312, 1991.","DOI":"10.1145\/113413.113414"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(83)90033-9","volume":"16","author":"T. Ibaraki","year":"1983","unstructured":"T. Ibaraki and N. Katoh. On-line computation of transitive closure of graphs. Information Processing Letters, 16:95\u201397, 1983.","journal-title":"Information Processing Letters"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","volume":"48","author":"G.F. Italiano","year":"1986","unstructured":"G.F. Italiano. Amortized efficiency of a path retrieval data structure. Theoretical Computer Science, 48:273\u2013281, 1986.","journal-title":"Theoretical Computer Science"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"V. K\u00fcchenhoff. On the efficient computation of the difference between consecutive database states. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proc. Second Int. Conf. on Deductive Object-Oriented Databases, Lecture Notes in Computer Science 566, pages 478\u2013502. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-55015-1_26"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"J. W. Lloyd and J. C. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, 11:217\u2013242, 1991.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"19_CR15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0743-1066(87)90009-4","volume":"4","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd, E. A. Sonenberg, and R. W. Topor. Integrity constraint checking in stratified databases. Journal of Logic Programming, 4(4):331\u2013343, 1987.","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00263192","volume":"18","author":"J-M. Nicolas","year":"1982","unstructured":"J-M. Nicolas. Logic for improving integrity checking in relational data bases. Acta Informatica, 18(3):227\u2013253, 1982.","journal-title":"Acta Informatica"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden van","year":"1976","unstructured":"M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733\u2013742, 1976.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56039-4_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:02:47Z","timestamp":1605628967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56039-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560395","9783540473602"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56039-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}