{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:40:12Z","timestamp":1737063612358,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_74","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:24:41Z","timestamp":1180675481000},"page":"1106-1120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Dynamic Approach to Termination Analysis for Active Database Rules"],"prefix":"10.1007","author":[{"given":"James","family":"Bailey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Poulovassilis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Newson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"issue":"1","key":"74_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/202106.202107","volume":"20","author":"A. Aiken","year":"1995","unstructured":"A. Aiken, J. Widom, and J. M. Hellerstein. Static analysis techniques for predicting the behavior of active database rules. ACM TODS, 20(1):3\u201341, 1995.","journal-title":"ACM TODS"},{"key":"74_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/3-540-62222-5_45","volume-title":"Proc. 6th ICDT","author":"J. Bailey","year":"1997","unstructured":"J. Bailey, L. Crnogorac, K. Ramamohanarao, and H. S\u00f8ndergaard. Abstract interpretation of active rules and its use in termination analysis. In Proc. 6th ICDT, LNCS 1186, pages 188\u2013202, 1997."},{"key":"74_CR3","unstructured":"J. Bailey, G. Dong, and K. Ramamohanarao. Decidability and undecidability results for the termination problem of active database rules. In Proc. of PODS\u201998."},{"issue":"2\/3","key":"74_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1008709127354","volume":"12","author":"J. Bailey","year":"1999","unstructured":"J. Bailey and A. Poulovassilis. Abstract interpretation for termination analysis in functional active databases. J. of Intell. Info. Systems, 12(2\/3):243\u2013273, 1999.","journal-title":"J. of Intell. Info. Systems"},{"key":"74_CR5","doi-asserted-by":"crossref","unstructured":"J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proc. 7th DBPL, September 1999.","DOI":"10.1007\/3-540-44543-9_16"},{"key":"74_CR6","doi-asserted-by":"crossref","unstructured":"E. Baralis, S. Ceri, and S. Paraboschi. Modularization techniques for active rules design. ACM TODS, 21(1), 1996.","DOI":"10.1145\/227604.227605"},{"issue":"3","key":"74_CR7","first-page":"353","volume":"10","author":"E. Baralis","year":"1998","unstructured":"E. Baralis, Ceri. S., and S. Paraboschi. Compile-time and runtime analysis of active behaviors. IEEE TKDE, 10(3):353\u2013370, 1998.","journal-title":"IEEE TKDE"},{"key":"74_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-60365-4_134","volume-title":"Proc. 2nd RIDS","author":"E. Baralis","year":"1995","unstructured":"E. Baralis and J. Widom. Using delta relations to optimize condition evaluation in active databases. In Proc. 2nd RIDS, LNCS 985, pages 292\u2013308, Athens, 1995."},{"issue":"3","key":"74_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/290593.290597","volume":"27","author":"T. Griffin","year":"1998","unstructured":"T. Griffin and B. Kumar. Algebraic change propagation for semijoin and outerjoin queries. ACM SIGMOD Record, 27(3):22\u201327, 1998.","journal-title":"ACM SIGMOD Record"},{"issue":"3","key":"74_CR10","first-page":"508","volume":"9","author":"T. Griffin","year":"1997","unstructured":"T. Griffin, L. Libkin, and H. Trickey. A correction to \u201cIncremental recomputation of active relational expressions\u201d. IEEE TKDE, 9(3):508\u2013511, 1997.","journal-title":"IEEE TKDE"},{"key":"74_CR11","doi-asserted-by":"crossref","unstructured":"A. Karadimce and S. Urban. Refined triggering graphs: A logic based approach to termination analysis in an active oo database. In Proc. of ICDE96, pages 384\u2013391.","DOI":"10.1109\/ICDE.1996.492187"},{"key":"74_CR12","doi-asserted-by":"crossref","unstructured":"K. Kulkarni, N. Mattos, and R. Cochrane. Active database features in SQL3. In N. Paton, editor, Active Rules in Database Systems, pages 197\u2013219. 1999.","DOI":"10.1007\/978-1-4419-8656-6_10"},{"key":"74_CR13","doi-asserted-by":"crossref","unstructured":"S. Y. Lee and T. W. Ling. A path removing technique for detecting trigger termination. In Proc. 6th EDBT, pages 341\u2013355, Valencia, 1998.","DOI":"10.1007\/BFb0100995"},{"key":"74_CR14","doi-asserted-by":"crossref","unstructured":"F. Llirbat, F. Fabret, and E. Simon. Eliminating costly redundant computations from SQL trigger executions. In Proc. ACM SIGMOD, pages 428\u2013439, 1997.","DOI":"10.1145\/253262.253357"},{"issue":"3","key":"74_CR15","first-page":"337","volume":"3","author":"X. Qian","year":"1991","unstructured":"X. Qian and G. Wiederhold. Incremental recomputation of active relational expressions. IEEE TKDE, 3(3):337\u2013341, 1991.","journal-title":"IEEE TKDE"},{"key":"74_CR16","unstructured":"D. Quass. Maintenance expressions for views with aggregation. In Proc. Workshop on Materialised Views: Techniques and Applications, pages 110\u2013118, 1996."},{"key":"74_CR17","doi-asserted-by":"crossref","unstructured":"S. Reddi, A. Poulovassilis, and C. Small. PFL: An active functional DBPL. In N. Paton, editor, Active Rules in Database Systems, pages 297\u2013308. 1999.","DOI":"10.1007\/978-1-4419-8656-6_16"}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T21:04:03Z","timestamp":1737061443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_74","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"15 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}