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

Meeting Name

1997 International Conference on Information, Communications and Signal Processing, 1997


Computer Science

Keywords and Phrases

CAD; Computer Aided Design; Concurrency Control; Concurrency Control Algorithm; Database Theory; Long-Running Transactions; Nested Transaction Tree; Object Oriented Databases; Open Nested Transaction Model; Prewrite Operations; Prewrite Subtransactions; Recovery Point Subtransaction; Safe Nested Transaction Model; Software Development Process; Software Engineering

Document Type

Article - Conference proceedings

Document Version

Final Version

File Type





© 1997 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Full Text Link