Modular Concurrency Control and Failure Recovery

Lui Sha, John P. Lehoczky, E. Douglas Jensen

Research output: Contribution to journalArticlepeer-review


This paper presents an approach to concurrency control based on the decomposition of both the database and the individual transactions. This approach is a generalization of serializability theory in that the set of permissible transaction schedules contains all the serializable schedules. In addition to providing a higher degree of concurrency than that provided by serializability theory, this approach retains three important properties associated with serializability: the consistency of the database is preserved, the individual transactions are executed correctly, and the concurrency control approach is modular, a concept formalized in this paper. The associated failure recovery procedure is also presented as is the concept of failure safety.

Original languageEnglish (US)
Pages (from-to)146-159
Number of pages14
JournalIEEE Transactions on Computers
Issue number2
StatePublished - 1988
Externally publishedYes


  • Concurrency control
  • consistency
  • correctness
  • failure recovery
  • modularity

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Modular Concurrency Control and Failure Recovery'. Together they form a unique fingerprint.

Cite this