• DocumentCode
    754813
  • Title

    A Case for Non-Two-Phase Locking Protocols that Ensure Atomicity

  • Author

    Silberschatz, Abraham

  • Author_Institution
    Department of Computer Science, University of Texas
  • Issue
    4
  • fYear
    1983
  • fDate
    7/1/1983 12:00:00 AM
  • Firstpage
    535
  • Lastpage
    538
  • Abstract
    A transaction is atomic if it can be considered, as far as other transactions are concerned, to be indivisible and instantaneous even in the case of failure. An almost universally accepted way to ensure atomicity is to use a strict two-phase locking protocol with a roll-back scheme for recovery in case of deadlock or failure. In this note, we argue that this method is not the most economical way to achieve this end. We develop a Dependency Graph model which is used to analyze the two-phase and non-two-phase locking schemes. It is shown that one way of choosing between the two types of schemes is to estimate the number of rollbacks required. If this number is large, a two-phase scheme is preferable; if small, a non-two-phase scheme should be selected. We demonstrate that with reasonable discipline, the number of such rollbacks can be minimized. Thus, contrary to common practice and belief, non-two-phase protocols can be effectively used in guaranteeing atomicity.
  • Keywords
    Atomicity; concurrency; consistency; database systems; deadlocks; lockdng protocols; rollbacks; transactions; Access protocols; Computer aided software engineering; Computer science; Concurrent computing; Contracts; Database systems; Environmental economics; Robustness; System recovery; Transaction databases; Atomicity; concurrency; consistency; database systems; deadlocks; lockdng protocols; rollbacks; transactions;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/TSE.1983.235107
  • Filename
    1703088