The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Equivalence and optimization of relational transactions
Journal of the ACM (JACM)
Lecture notes in computer science on ICDT '88
A Guide to DB2
Principles of Database Systems
Principles of Database Systems
Theory of Relational Databases
Theory of Relational Databases
Declarative updates of relational databases
ACM Transactions on Database Systems (TODS)
Verifiable properties of database transactions
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A procedural semantics for stratified database updates
Annals of Mathematics and Artificial Intelligence
Analysis and optimization of active databases
Data & Knowledge Engineering
On the expressive power of update primitives
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
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.