Deadlock removal using partial rollback in database systems

Authors:
Donald Fussell;Zvi M. Kedem;Abraham Silberschatz
Affiliations:
The University of Texas at Austin, Austin, Texas;State University of New York at Stony Brook, Stony Brook, New York;The University of Texas at Austin, Austin, Texas
Venue:
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Year:
1981

Citing 6
Cited 5

System level concurrency control for distributed database systems

ACM Transactions on Database Systems (TODS)
Consistency in Hierarchical Database Systems

Journal of the ACM (JACM)
System Deadlocks

ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system

Communications of the ACM
Avoiding deadlock in distributed data bases

ACM '74 Proceedings of the 1974 annual conference - Volume 1
Cooperating Sequential Processes, Technical Report EWD-123

Cooperating Sequential Processes, Technical Report EWD-123

Partial rollback in object-oriented/object-relational database management systems

Proceedings of the eleventh international conference on Information and knowledge management
An algorithm for minimizing roll back cost

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Compatibility and commutativity in non-two-phase locking protocols

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols

VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Partial rollback in object-oriented/object-relational database management systems with dual buffer

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of removing deadlocks from concurrent database systems using the two-phase locking protocol is considered. In particular, for systems which use no a priori information about transaction behavior in order to avoid deadlocks, it has generally been assumed necessary to totally remove and restart some transaction involved in a deadlock in order to relieve the situation. In this paper, a new approach to deadlock removal in such systems based on partial rollbacks is introduced. This approach does not in general require the total removal of a transaction to eliminate a deadlock. The task of optimizing deadlock removal using this method is discussed for systems allowing both exclusive and shared locking. A method is given for implementing this approach with no more storage overhead than that required for total removal and restart.