A Dynamic Granularity Locking Protocol for Tree-structured Databases

Haldar, S and Subramanian, DK (1991) A Dynamic Granularity Locking Protocol for Tree-structured Databases. In: 1991 Symposium on Applied Computing, 3-5 April, Kansas City,MO, pp. 372-380.

Preview

PDF A_Dynamic_Granularity_Locking_Protocol.pdf Download (1MB)

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

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	29 May 2006
Last Modified:	19 Sep 2010 04:27
URI:	http://eprints.iisc.ac.in/id/eprint/7051

Actions (login required)

View Item