Title :
A dynamic granularity locking protocol for tree-structured databases
Author :
Haldar, S. ; Subramanian, D.K.
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
Abstract :
A dynamic granularity locking protocol for tree-structured databases is presented. It is a variant of multi-granularity locking protocol which takes the system load condition and the conflict status of the transactions into an account while locking a data granule. It shares the advantages exhibited by both coarse and fine granularity locking protocols, and retains the power of multi-granularity locking protocol. It dynamically changes the granule size of the data to be locked depending upon both the transaction-requirement and the current system load. The strategy of the protocol is to lock coarse granules at light system load or when transaction conflicts are less, and to lock fine granules at heavy system load or when the conflicts are more. The protocol uses strict two phase locking, in conjunction, to ensure serializability. A simulation study has also been done to study the performance of the proposed protocol
Keywords :
object-oriented databases; protocols; transaction processing; trees (mathematics); coarse; conflict status; dynamic granularity locking protocol; fine granularity; granule size; serializability; simulation study; transaction-requirement; tree-structured databases; two phase locking; Automation; Computer science; Concurrency control; Concurrent computing; Control systems; Database systems; Interleaved codes; Processor scheduling; Protocols; Transaction databases;
Conference_Titel :
Applied Computing, 1991., [Proceedings of the 1991] Symposium on
Conference_Location :
Kansas City, MO
Print_ISBN :
0-8186-2136-2
DOI :
10.1109/SOAC.1991.143905
