Abstract
An important behavioural property for sets of active database rules is that of termination. In current commercial database systems, termination is guaranteed by imposing a fixed upper limit on the number of recursive rule firings that may occur. This can have undesirable effects such as prematurely halting correct executions. We describe a new approach based on a dynamic upper limit to the number of rule firings. This limit reflects knowledge about past rule behaviour on the database and provides a more accurate measure for when the DBMS should terminate rule execution. The approach incurs little cost and can easily be integrated with current techniques for static analysis of active rules.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
J. Bailey, L. Crnogorac, K. Ramamohanarao, and H. Søndergaard. Abstract interpretation of active rules and its use in termination analysis. In Proc. 6th ICDT, LNCS 1186, pages 188–202, 1997.
J. Bailey, G. Dong, and K. Ramamohanarao. Decidability and undecidability results for the termination problem of active database rules. In Proc. of PODS’98.
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.
J. Bailey and A. Poulovassilis. An abstract interpretation framework for termination analysis of active rules. In Proc. 7th DBPL, September 1999.
E. Baralis, S. Ceri, and S. Paraboschi. Modularization techniques for active rules design. ACM TODS, 21(1), 1996.
E. Baralis, Ceri. S., and S. Paraboschi. Compile-time and runtime analysis of active behaviors. IEEE TKDE, 10(3):353–370, 1998.
E. Baralis and J. Widom. Using delta relations to optimize condition evaluation in active databases. In Proc. 2nd RIDS, LNCS 985, pages 292–308, Athens, 1995.
T. Griffin and B. Kumar. Algebraic change propagation for semijoin and outerjoin queries. ACM SIGMOD Record, 27(3):22–27, 1998.
T. Griffin, L. Libkin, and H. Trickey. A correction to “Incremental recomputation of active relational expressions”. IEEE TKDE, 9(3):508–511, 1997.
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–391.
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.
S. Y. Lee and T. W. Ling. A path removing technique for detecting trigger termination. In Proc. 6th EDBT, pages 341–355, Valencia, 1998.
F. Llirbat, F. Fabret, and E. Simon. Eliminating costly redundant computations from SQL trigger executions. In Proc. ACM SIGMOD, pages 428–439, 1997.
X. Qian and G. Wiederhold. Incremental recomputation of active relational expressions. IEEE TKDE, 3(3):337–341, 1991.
D. Quass. Maintenance expressions for views with aggregation. In Proc. Workshop on Materialised Views: Techniques and Applications, pages 110–118, 1996.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bailey, J., Poulovassilis, A., Newson, P. (2000). A Dynamic Approach to Termination Analysis for Active Database Rules. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_74
Download citation
DOI: https://doi.org/10.1007/3-540-44957-4_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67797-0
Online ISBN: 978-3-540-44957-7
eBook Packages: Springer Book Archive