The queue protocol: a deadlock-free, homogeneous, non-two-phase locking protocol

Authors:
Udo Kelter
Affiliations:
University of Dortmund, Department of Computer Science, STL, P.O. Box 500500, D-4600 Dortmund 50, Germany
Venue:
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1988

Citing 6
Cited 0

Compatibility and commutativity of lock modes

Information and Control
Strictness and serializability

3rd annual symposium on theoretical aspects of computer science on STACS 86
A transaction model supporting complex applications in integrated information systems

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Consistency in Hierarchical Database Systems

Journal of the ACM (JACM)
A Dynamic Tree-Locking Protocol

Proceedings of the Second International Conference on Data Engineering
An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols

VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The M-pitfall protocol (MPP) is the most general homogeneous non-two-phase locking protocol which supports shared and exclusive locks. It has two major disadvantages: it is not deadlock-free and it has the paradoxical property that concurrency is often reduced if shared locks are used instead of exclusive locks. This paper presents a new protocol, the Queue Protocol (QP), which removes these deficiencies. Although the QP can be regarded an enhancement of the MPP, pitfalls are no more used in the QP; thus, the QP has the further advantage that processing overhead due to pitfalls is avoided.