A concurrency control theory for nested transactions (preliminary report)
C Beeri, PA Bernstein, N Goodman, MY Lai… - Proceedings of the …, 1983 - dl.acm.org
C Beeri, PA Bernstein, N Goodman, MY Lai, DE Shasha
Proceedings of the second annual ACM symposium on Principles of distributed …, 1983•dl.acm.orgConcurrency control is the activity of synchronizing transactions that access shared data. A
concurrency control algorithm is regarded as correct if it ensures that any interleaved
execution of transactions is equivalent to a serial one. Such executions are called
serializable. Serializability theory provides a method for modelling and analyzing the
correctness of concurrency control algorithms [BSW, Pa]. The concept of nested transaction
has recently received much attention [GR],[Mo]. In a nested transaction model, each …
concurrency control algorithm is regarded as correct if it ensures that any interleaved
execution of transactions is equivalent to a serial one. Such executions are called
serializable. Serializability theory provides a method for modelling and analyzing the
correctness of concurrency control algorithms [BSW, Pa]. The concept of nested transaction
has recently received much attention [GR],[Mo]. In a nested transaction model, each …
Concurrency control is the activity of synchronizing transactions that access shared data. A concurrency control algorithm is regarded as correct if it ensures that any interleaved execution of transactions is equivalent to a serial one. Such executions are called serializable. Serializability theory provides a method for modelling and analyzing the correctness of concurrency control algorithms [BSW, Pa].
The concept of nested transaction has recently received much attention [GR], [Mo]. In a nested transaction model, each transaction can invoke sub- transactions, which can invoke sub-subtransactions, and so on. The natural modelling concept is the tree log. The leaves of a tree log are atomic operations executed by the underlying system. Internal nodes are operations (as seen by their parents) implemented as transactions (as seen by their children). Nodes are related by a partial order <, where x<y means x executes before y [La].
ACM Digital Library