Simplification rules and complete axiomatization for relational update transactions
- 1 September 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 16 (3) , 439-475
- https://doi.org/10.1145/111197.111208
Abstract
Relational update transactions consisting of line programs of inserts, deletes, and modifications are studied with respect to equivalence and simplification. A sound and complete set of axioms for proving transaction equivalence is exhibited. The axioms yield a set of simplification rules that can be used to optimize efficiently a large class of transactions of practical interest. The simplification rules are particularly well suited to a dynamic environment where transactions are presented in an on-line fashion, and where the time available for optimization may consist of arbitrarily short and sparse intervals.Keywords
This publication has 1 reference indexed in Scilit:
- Equivalence and optimization of relational transactionsJournal of the ACM, 1988