Speculation Based Nested Locking Protocol to Increase the Concurrency of Nested Transactions

Authors:
P. Krishna Reddy;Masaru Kitsuregawa
Affiliations:
-;-
Venue:
IDEAS '00 Proceedings of the 2000 International Symposium on Database Engineering & Applications
Year:
2000

Citing 0
Cited 3

Speculative Locking Protocols to Improve Performance for Distributed Database Systems

IEEE Transactions on Knowledge and Data Engineering
Using Imprecise Concurrency Control and Speculative Lending of Prepared Data-item in Distributed Real-Time Nested Transactions

DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
A system supporting nested transactions in DRTDBSs

HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors propose an improved concurrency control protocol based on speculation for nested transactions and explain how it increases both intraand inter-transaction concurrency as compared to J.E.B. Moss's (1985) nested locking protocol. In the proposed speculative nested locking (SNL) protocol, whenever a sub-transaction finishes work with a data object (produces after-image), it's parent inherits the lock. The waiting sub-transaction carries out speculative executions by accessing both before- and after-images of preceding sub-transaction and selects appropriate execution after the termination of the preceding subtransaction. In this way, SNL allows multiple executions to be carried out for a transaction by trading extra processing and main memory resources to increase concurrency.