Deadlock removal using partial rollback in database systems

Donald Fussell, Zvi M. Kedem, Abraham Silberschatz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 1981 ACM SIGMOD International Conference on Management of Data, SIGMOD 1981
PublisherAssociation for Computing Machinery
Pages65-73
Number of pages9
ISBN (Print)0897910400
DOIs
StatePublished - Apr 29 1981
Event1981 ACM SIGMOD International Conference on Management of Data, SIGMOD 1981 - Ann Arbor, United States
Duration: Apr 29 1981May 1 1981

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078

Other

Other1981 ACM SIGMOD International Conference on Management of Data, SIGMOD 1981
CountryUnited States
CityAnn Arbor
Period4/29/815/1/81

ASJC Scopus subject areas

  • Software
  • Information Systems

Cite this