Abstract
Many algorithms have been proposed that detect non-termination of active database rules. However, most of these provide a conservative estimate–they detect all potential cases of non-termination. The onus is on the database programmers to further analyze these cases and give more definite results about non-termination. In this paper we show how the database programmer can automatically detect non-termination using an existing symbolic model checker. Our approach does not require much expertise on the part of the database programmer, and can be used to detect termination cases which the conservative approaches reject as non-terminating ones.
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.
Similar content being viewed by others
References
R. Agrawal and N. Gehani. Ode (Object Database and Environment): The Language and the Data Model. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 36–45, Portland, OR, May 1989.
A. Aiken, J. M. Hellerstein, and J. Widom. Static Analysis Techniques for Predicting the Behavior of Active Database Rules. ACM Transactions on Database Systems, 2O(l):3–41, March 1995.
J. Bailey, L. Crnogorac, K. Ramamohanarao, and H. Søndergaard. Abstract Interpretation of Active Rules and its use in Termination Analysis. In Proceedings of the 6th International Conference on Database Theory, pages 188–202, Delphi, Greece, January 1997.
J. Bailey, G. Dong, and K. Ramamohanarao. Decidability and Undecidability Results for the Termination Problem of Active Database Rules. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 264–273, Seattle, Washington, June 1998.
E. Baralis, S. Ceri, and S. Parboschi. Improved Rule Analysis by means of Triggering and Activation Graphs. In T. Sellis, editor, Rules in Database Systems, volume 985 of Lecture Notes in Computer Science, pages 165–181. Springer-Verlag, 1995.
E. Baralis and J. Widom. An Algebraic Approach to Rule Analysis in Expert Database Systems. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 475–486, Santiago, Chile, September 1994.
K. P. Eswaran. Specification, Implementations and Interactions of a Trigger Subsystem in an Integrated Database System. Technical Report IBM Research Report RJ 1820, IBM San Jose Research Laboratory, August 1976.
N. Gehani and H. V. Jagadish. Ode as an Active Database: Constraints and Triggers. In Proceedings of the 17th International Conference on Very Large Databases, pages 327–336, Barcelona, Spain, September 1991.
L. M. Haas et al. Starburst Mid-flight: As the Dust Clears. IEEE Transactions on Knowledge and Data Engineering, 2(1):143–160, March 1990.
D. Jackson. Niptick: A Checkable Specification Language. In Proceedings of the Workshop on Formal Methods in Software Practice, San Diego, CA, January 1996.
A. P. Karadimce and S. D. Urban. Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database. In Proceedings of the 12th International Conference on Data Engineering, pages 384–391, New Orleans, LA, February 1996.
L. van der Voort and A. Siebes. Termination and Confluence of Rule Execution. In Proceedings of the 2nd International Conference on Information and Knowledge Management, pages 245–255, Washington, DC, November 1993.
K. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. PhD thesis, School of Computer Science, Carnegie Mellon University, 1992.
I. Ray and I. Ray. Detecting Termination of Active Database Rules Using Symbol Model Checking. Technical Report CIS-TR-005-2001, Computer and Information Science Dept., University of Michigan-Dearborn, May 2001. Available from http://www.engin.umd.umich.edu/~iray/research/index.html/.
E. Simon and A. Kotz-Dittrich. Promises and Realities of Active Database Systems. In Proceedings of the 21st International Conference on Very Large Databases, pages 642–653, Zürich, Switzerland, September 1995.
M. Stonebraker, L. A. Rowe, and M. Hirohama. The Implementation of POSTGRES. IEEE Transaction on Knowledge and Data Engineering, 2(1): 125–142, March 1990.
J. Widom and S. Ceri. Active Database Systems. Triggers and Rules for Advanced database Processing. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996.
J. Widom, R. Cochrane, and B. Lindsay. Implementing Set-Oriented Production Rules as an Extension to Starburst. In Proceedings of the 17th International Conference on Very Large Databases, Barcelona, Spain, September 1991.
J. M. Wing and M. Vazari-Farahani. A Case Study in Model Checking Software Systems. Science of Computer Programming, 28:273–299, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ray, I., Ray, I. (2001). Detecting Termination of Active Database Rules Using Symbolic Model Checking. In: Caplinskas, A., Eder, J. (eds) Advances in Databases and Information Systems. ADBIS 2001. Lecture Notes in Computer Science, vol 2151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44803-9_21
Download citation
DOI: https://doi.org/10.1007/3-540-44803-9_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42555-7
Online ISBN: 978-3-540-44803-7
eBook Packages: Springer Book Archive