A practical deadlock avoidance algorithm for data base systems
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper)
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
The existence of multiple levels of resources in data base systems presents a problem when resources must be shared among contending users. For example, some users may be interested in an entire file while others are only interested in one or a few records of the file. Intention locks have previously been introduced to permit multiple levels of locking in conjunction with deadlock detection methods[1,2]. These intention locks can be view as housekeeping entries to record the pattern of usage of resources. When viewed in this way, no new locking modes need be exposed to a system user. Further, the basic idea behind intention locks can then be directly applied to systems which use deadlock avoidance methods[3,4].