Multigranularity locking in multiple job classes transaction processing system

  • Authors:
  • Shan-hoi Ng;Sheung-lun Hung

  • Affiliations:
  • Department of Computer Science, City Polytechnic of Hong Kong, HONG KONG;-

  • Venue:
  • ACM SIGMOD Record
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

The conditions of when to apply fine and coarse granularity to different kinds of transaction are well understood. However, it is not very clear how multiple job classes using different lock granularities affect each other. This study aims at exploring the impact of multigranularity locking on the performance of multiple job classes transaction processing system which is common in multiuser database system. There are two key findings in the study. Firstly, lock granularity adopted by identical job classes should not differ from each other by a factor of more than 20; otherwise, serious data contention may result. Secondly, short job class transactions are generally benefited when its level of granularity is similar to that of the long job class since this will reduce the additional lock overhead and data contention which are induced by multigranularity locking.