Abstract
One of the major applications of trigger rules is to maintain database integrity. However, since trigger rules, like computer programs, may not be written correctly, it is important to have tools to verify the correctness. Generally, this is an undecidable problem. Only few works exist on this problem. However, most of these works either depend on human inspection, or incur a run-time overhead. In this paper, we introduce a new approach which does not depend on any human judgment nor any run-time monitoring. The trigger rules we are checking are those trigger rules which update object properties but do not insert any new object nor destroy an existing object. The constraints in our paper do not have any existential quantifier. If our method returns “yes”, we can guarantee that the set of trigger rules are written correctly to enforce the given constraint.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Widom A. Aiken and J.M. Hellerstein. Behavior of database production rules: Termination, conuence, and observable determinism. In SIGMOD, pages 59–68, June 1992. San Diego.
S.D. Urban A.P. Karadimce. Refined trigger graphs: A logic-based approach to termination analysis in an active object-oriented database. In ICDE, pages 384–391, 1996. New Orleans.
S. Ceri E. Baralis and S. Paraboschi. Improved rule analysis by means of triggering and activation graphs. In RIDS, pages 165–181, 1995.
S. Ceri E. Baralis and S. Paraboschi. Run-time detection of non-terminating active rule systems. In DOOD, pages 38–54, 1995. Singapore.
S. Ceri E. Baralis and S. Paraboschi. Compile-time and runtime analysis of active behaviors. In IEEE Transactions on Knowledge and Data Engineering, pages 353–370, May/June 1998.
S.Y. Lee and T.W. Ling. Further improvements on integrity constraint checking for stratifiable deductive databases. In VLDB, pages 495–505, 1996. Bombay.
S.Y. Lee and T.W. Ling. A path removing technique for detecting trigger termination. In EDBT, pages 341–355, 1998. Valencia, Spain.
T.W. Ling. The prolog not-predicate and negation as failure rule. In New Generation Computing, 1990.
S. Ceri and J. Widom. Deriving production rules for constraint maintenance. In Proc 16th VLDB Conf, pages 566–577, 1990. Brisbane, Australia.
S.Y. Lee and T.W. Ling. Refined termination decision in active databases. In DEXA, pages 182–191, 1997. Toulouse.
S.Y. Lee and T.W. Ling. Unrolling cycle to decide trigger termination. In VLDB, 1999. Edinburgh, UK. Accepted to be published.
T. Weik and A. Heuer. An algorithm for the analysis of termination of large trigger sets in an oodbms. In Proceedings of the International Workshop on Active and Real-Time Databases Systems, June 1995. Skovde, Sweden.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, SY., Ling, TW. (1999). Verify Updating Trigger Correctness. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-48309-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66448-2
Online ISBN: 978-3-540-48309-0
eBook Packages: Springer Book Archive