Abstract
Todays technologies are capable to assist database developers in designing complex actions (e.g. stored procedures, active database rules). However, automatic generation and extention of given actions holds a danger — The original intention of actions might get canceled or even reversed, e.g. by some appended repairing action enforcing an integrity constraint. This problem might cause non-desired situations where an action commits although one of the intended database modifications was not applied.
In this paper, we deal with the characterization and preservation of effects (intentions) of database actions. As an extention of our current approach for effect preservation, we present a method for handling updates including non-nested loops. A transformation process is proposed that modifies a given action S to S′,such that S′ does preserve the effects. In order to reduce additional run-time overhead of S′,most of the computation is shifted to compile-time.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35693-8_16
Chapter PDF
Similar content being viewed by others
Keywords
References
E. Baralis and J. Widom. An algebraic approach to static analysis of active database rules. In ACM Transactions on Database Systems, volume 25(3), pages 269–332, September 2000.
S. Ceri, P.Fraternali, S. Paraboschia, and L. Tanca. Automatic gerneration of production rules for integrity maintenance. In ACM Transactions on Database Systems, volume 19(3), pages 367–422, 1994.
E.W. Dijkstra and C.S. Scholten. Predicate calculus and program semantics. Springer-Verlag, Texts and Monographs in Computer Science, 1989.
M. Balaban, S. Jurk. Effect Preservation As A Means For Achieving Update Consistency. In 5th International Conf. on Flexible Query Answering Systems,Lecture Notes in Computer Science, 2002 (to appear).
M. Balaban, S. Jurk. Intentions of Operations — Characterization and Preservation. In 2nd International Workshop on Evolution and Change in Data Management,Lecture Notes in Computer Science, 2002 (to appear).
F. Bry. Intensional updates: Abduction via deduction. In Proc. 7th Conf. on Logi Programming, 1990.
Greg Nelson. A generalization of dijkstras calculus. ACM Transactions on Programming Languages and Systems, 11: 517–561, 1989.
P. Fraternali and S. Paraboschi and L. Tanca. Automatic Rule Generation for Constraints Enforcement in Active Databases. Springer WICS, 1993.
Joan Antoni Pastor. Extending the synthesis of update transaction programs to handle existential rules in deductive databases. In Deductive Approach to Information Systems and Databases, pages 189–218, 1994.
Joan Antoni Pastor-Collado and Antoni Olive. Supporting transaction design in conceptual modelling of information systems. In Conference on Advanced Information Systems Engineering, pages 40–53, 1995.
D. Plexousakis and J. Mylopoulos. Accommodating integrity constraints during database design. Lecture Notes in Computer Science, 1057, 1996.
K.D. Schewe. Consistency enforcement in entity-relationship and object-oriented models. Data and Knowledge Eng., 28 (1): 121–140, 1998.
K.D. Schewe and B. Thalheim. Towards a theory of consistency enforcement. Acta Informatics, 36: 97–141, 1999.
S.Y. Lee, T.W. Ling. Further Improvement on Integrity Constraint Checking for Stratisfiable Deductive Databases. In Proc. 22th Conf. on VLDB, 1996.
J. Widom and S. Ceri. Deriving production rules for constraint maintenance. In Proc. 16th Conf. on VLDB, pages 566–577, 1990.
J. Widom and S. Ceri. Active Database Systems. Morgan-Kaufmann, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Jurk, S., Balaban, M. (2003). Towards Effect Preservation of Updates with Loops. In: Gertz, M. (eds) Integrity and Internal Control in Information Systems V. IICIS 2002. IFIP — The International Federation for Information Processing, vol 124. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35693-8_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-35693-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5535-0
Online ISBN: 978-0-387-35693-8
eBook Packages: Springer Book Archive