Ekaterina Pavlova , Igor Nekrestyanov
September 1997
Proceedings of the First East-European Symposium on Advances in Databases and Information Systems (ADBIS)
Advances in Databases and Information Systems
2-5 September 1997
In this paper we consider real-time concurrency control for the nested transaction model. We analyze problems that have pure optimistic and pessimistic approaches. As the solution we propose a hybrid concurrency control algorithm which acts as an optimistic for transactions from different transaction trees and as pessimistic inside a single transaction tree.
This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/