A probabilistic study on the transaction´s waits and deadlocks

Author

Huang, Y.F. ; Chin, Y. II

Author_Institution

Inst. of Comput. & Decision Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

fYear

1988

fDate

5-7 Oct. 1988

Firstpage

337

Lastpage

344

Abstract

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.<>

Keywords

concurrency control; database theory; probability; transaction processing; accessible unit; data blocks; data object; data object distributions; database areas; database files; deadlock situations; granule; index blocks; locking unit; probabilistic study; record occurrence; straw man analysis; transaction waits; tuple; Chromium; System recovery; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International

Conference_Location

Chicago, IL, USA

Print_ISBN

0-8186-0873-0

Type

conf

DOI

10.1109/CMPSAC.1988.17196

Filename

17196