Abstract
For each view predicate, a Transaction Tree (T-tree) can be derived from a database schema. T-trees are data structures which serve to anticipate transactions by which view update requests can be translated to updates of underlying base relations. Since T-trees are obtained at schema specification time, i.e. in advance of update time, they provide a basis for planning strategies with which appropriate transactions can be chosen to satisfy view update requests, and also for strategies which support schema evolution. The main features of the approach are that it is simple, it offers solutions to the problem of missing values, it is correct and it is complete (in the case of nonrecursive views).
Dr. H. Decker has collaborated as a guest scientist with DSIC
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
S. Ceri, P. Fraternali, S. Paraboschi, L. Tanca. Automatic generation of production rules for integrity maintenance. ACM Transactions on Database Systems, Vol. 19, #3, 1994
Short version in ICDT 90. Springer, LNCS 470, pp. 437–454, 1990.
A.C. Kakas, P. Mancarella. Database updates through abduction. Proc. 16 VLDB 1990.
J.A. Larson, A.P. Sheth. Updating relational views using knowledge at view definition and view update time. Information Systems, Vol. 16 #2, pp. 145168, 1991.
L. Mota, M. Celma. Automatic Generation of Trigger Rules for Integrity Enforcement in Relational Databases with View Definition. Proc. 3th Int. Conference on Flexible Query Answering Systems, FQAS’98. Roskilde, Denmark. Springer, LNCS 1495, pp. 286–297, 1998.
G. Moerkotte, P.C. Lockerman. Reactive consistency control in deductive databases. ACm TODS, Vol. 16, #4, pp. 670–702. 1991.
J.A. Pastor. Automatic synthesis of update transaction programs in deductive databases. PhD thesis, DLSI, UPC, 1996.
E. Teniente, A. Olivé. Updating knowledge bases while maintaining consistency. VLDB Journal, Vol. 4, #2, pp. 193–241, 1995.
B. Wiltrich. On updates and inconsistency repairing in knowledge bases. Proc. 9` h IEEE Int. Conference on Data Engineering, pp-608–615, 1993.
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
Mota-Herranz, L., Celma-Giménez, M., Decker, H. (2001). Transaction Trees for Planning Knowledge Revision. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadrożny, S. (eds) Flexible Query Answering Systems. Advances in Soft Computing, vol 7. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1834-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1834-5_17
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1347-0
Online ISBN: 978-3-7908-1834-5
eBook Packages: Springer Book Archive