A probabilistic study on the transaction´s waits and deadlocks

The ´straw man´ analysis (see J.N. Gray et al., 1981) is based on the assumption that the accessible unit and locking unit are both a record occurrence (or a tuple); consequently the results cannot be applied when a locking unit is a large granule such as an area, a file, or an index (or a data) block. In this paper, the probabilities of a transaction´s waits and deadlocks are derived when the accessible unit is a data object and the locking unit is a granule. The results can be used to explain a transaction´s wait and deadlock situations for: (1) various sizes of a granule; and (2) different distributions of data objects accessed by a transaction.<>