A Concurrency Control Algorithm for an Open and Safe Nested Transaction Model
This document has been relocated to http://scholarsmine.mst.edu/comsci_facwork/219
There were 4 downloads as of 28 Jun 2016.
We present a concurrency control algorithm for an open and safe nested transaction model. We use prewrite operations in our model to increase the concurrency. Prewrite operations are modeled as subtransactions in the nested transaction tree. The subtransaction which initiates prewrite subtransactions are modelled as recovery point subtransaction. The recovery point subtransaction can release their locks before its ancestors commit. Thus, our model increases the concurrency in comparison to other nested transaction models. Our model is useful an environment of long-running transactions common in object oriented databases, computer aided design and in the software development process