A dynamic approach to termination analysis for active database rules

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 1106-1120

  Bailey, James ^a   Poulovassilis, Alexandra ^a   Newson, Peter ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE DATABASE; ACTIVE RULES; COMMERCIAL DATABASE SYSTEM; RECURSIVE RULES; TERMINATION ANALYSIS; UNDESIRABLE EFFECTS; UPPER LIMITS;

LOGIC PROGRAMMING;

DATABASE SYSTEMS;

EID: 84867791261     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_74     Document Type: Conference Paper

References (17)

1. A. Aiken, J. Widom, and J.M. Hellerstein. Static analysis techniques for predicting the behavior of active database rules. ACM TODS, 20(1):3-41, 1995.
2. J. Bailey, L. Crnogorac, K. Ramamohanarao, and H. S-ndergaard. Abstract inter-pretation of active rules and its use in termination analysis. In Proc. 6th ICDT, LNCS 1186, pages 188-202, 1997.
3. J. Bailey, G. Dong, and K. Ramamohanarao. Decidability and undecidability results for the termination problem of active database rules. In Proc. of PODS'98.
4. J. Bailey and A. Poulovassilis. Abstract interpretation for termination analysis in functional active databases. J. of Intell. Info. Systems, 12(2 /3):243-273, 1999.
5. J. Bailey and A. Poulovassilis. An abstract interpretation framework for termina-tion analysis of active rules. In Proc. 7th DBPL, September 1999.
6. E. Baralis, S. Ceri, and S. Paraboschi. Modularization techniques for active rules design. ACM TODS, 21(1), 1996.
7. E. Baralis, Ceri. S., and S. Paraboschi. Compile-time and runt ime analysis of active behaviors. IEEE TKDE, 10(3):353-370, 1998.
8. E. Baralis,J. Widom Using delta relations to optimize condition evaluation in active databases In Proc. 2nd RIDS, LNCS 985 292-308, Athens 1995
9. T. Grin and B. Kumar. Algebraic change propagation for semijoin and outerjoin queries. ACM SIGMOD Record, 27(3):22-27, 1998.
10. T. Grin, L. Libkin, and H. Trickey. A correction to\ Incremental recomputation of active relational expressions". IEEE TKDE, 9(3):508-511, 1997.
11. A. Karadimce and S. Urban. Re-ned triggering graphs: A logic based approach to termination analysis in an active oo database. In Proc. of ICDE96, pages 384-391.
12. K. Kulkarni, N. Mattos, and R. Cochrane. Active database features in SQL3. In N. Paton, editor, Active Rules in Database Systems, pages 197-219. 1999.
13. S. Y. Lee and T. W. Ling. A path removing technique for detecting trigger termi-nation. In Proc. 6th EDBT, pages 341-355, Valencia, 1998.
14. F. Llirbat, F. Fabret, and E. Simon. Eliminating costly redundant computation s from SQL trigger executions. In Proc. ACM SIGMOD, pages 428-439, 1997.
15. X. Qian and G. Wiederhold. Incremental recomputation of active relational ex-pressions. IEEE TKDE, 3(3):337-341, 1991.
16. D. Quass. Maintenance expressions for views with aggregation. In Proc. Workshop on Materialised Views: Techniques and Applications, pages 110-118, 1996.
17. S. Reddi, A. Poulovassilis, and C. Small. PFL: An active functional DBPL. In N. Paton, editor, Active Rules in Database Systems, pages 297-308. 1999.