• Corpus ID: 49960900


  author={Philip A. Bernstein and Nathan Goodman},
Dozens of articles have been published describing "new" concurrency control algorithms for distributed database systems. All of these algorithms can be derived and understood using a few basic concepts. We show how to decompose the concurrency control problem into several subproblems, each of which has iust a few known solutions. By appropriately combining known solutions to the subproblems, we show that all published concurrency control algorithms and many new ones can be constructed. The glue… 

Figures from this paper

An abstract model of database concurrency control algorithms

An abstract model of concurrency control algorithms is presented, allowing them to be specified in terms of the information that they require, the conditions under which blocking or restarts are called for, and the manner in which requests are processed.

Improvement on Concurrency Control in A Distributed Database

The proposed architecture of the distributed database uses a star-wired topology with Intelligent Ethernet managed switches Network, which ensures consistent and correct transaction, efficient data collection and management and recoverability of data in a distributed database.

The Performance of Concurrency Control and Recovery Algorithms for Transaction-Oriented Database Systems.

Fast Path development experience supports the idea that the use of a variety of methods of concurrency control by a single transaction is rea sonable and is not as difficult as might be expected, at least when there is fast access to shared data.

Approximation for the mean value performance of locking algorithms for distributed database systems: a partitioned database

A method to approximate the mean value of various performance parameters in distributed database systems using locking for concurrency control and its ability to model the interaction between resource and data contention and the resulting effect on system performance is proposed.

Performance Models of Timestamp-Ordering Concurrency Control Algorithms in Distributed Databases

  • V. Li
  • Computer Science
    IEEE Transactions on Computers
  • 1987
This paper develops a performance model of timestamp-ordering concurrency control algorithms in a DDB that consists of five components: input data collection, transaction processing model, communication subnetwork model, conflict model, and performance measures estimation.

An algorithm for concurrency control and recovery in replicated distributed databases

An algorithm for handling replicated data, which allows users to operate on data so long as one copy is “available,” and handles clean, detectable site failures, but not Byzantine failures or network partitions.

Integrated concurrency control and recovery mechanisms: design and performance evaluation

A unified view of the problems associated with concurrency control and recovery for transaction-oriented multiuser centralized database management systems is taken, and several integrated mechanisms are presented.

A concurrency control theory for nested transactions (Preliminary Report)

Serializability theory provides a method for modelling and analyzing the correctness of concurrency control algorithms and the concept of nested transaction has recently received much attention.

Optimal granularity and degree of multiprogramming in a distributed database system

  • K. H. PunG. Belford
  • Computer Science
    1986 IEEE Second International Conference on Data Engineering
  • 1986
Conclusions concerning the optimal choices of granularity and the degree of multiprogramming in different environments are drawn to provide guidelines in achieving good performance in a distributed database system (DDBS).



Concurrency control algorithms for multiversion database systems

This paper presents a theory for analyzing the correctness of concurrency control algorithms for multiversion database systems and uses the theory to analyze some new algorithms and some previously published ones.

Distributed database concurrency controls using before-values

A careful distinction is made between design decisions concerning communications andDesign decisions concerning the responses to read/write requests, and two schemes for producing such controls are given.

Formal Aspects of Serializability in Database Concurrency Control

It is shown why locking mechanisms lead to correct operation, it is shown that two proposed mechanisms for distributed environments are special cases of locking, and a new version of lockdng is presented that alows more concurrency than past methods.

The Effects of Concurrency Control on Database Management System Performance

The simulations modeled a variety of concurrency control algorithms to study the additional tradeoffs in a distributed database and indicated that with a high speed network and mostly local database activities, either Concurrency control approach is acceptable, but as the network becomes slower, the decentralized control algorithms are preferable.

System level concurrency control for distributed database systems

This paper presents designs for several distributed concurrency controls and demonstrates that they work correctly and investigates some of the implications of global consistency of a distributed database and discusses phenomena that can prevent termination of application programs.

Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres

  • M. Stonebraker
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1979
Algorithm for ensuring the consistency of a distributed relational data base subject to multiple, concurrent updates and mechanisms to correctly update multiple copies of objects are included.


The thesis presents a model for computation in a distributed information system in which the sites and communication links may fail, and discusses implementation techniques that could be used to limit the effects of failures in a real system to those described in the model.

Parallelism and recovery in database systems

It is proved that transactions executed according to a certain scheme by which readers and writers may work simultaneously on the same object have the correct effect; i.e., consistency is preserved.

Locking and Deadlock Detection in Distributed Data Bases

Two protocols for the detection of deadlocks in distributed data bases are described–a hierarchically organized one and a distributed one that requires that the global graph be built and maintained in order for deadlocks to be detected.

Subsystems of Processes with Deadlock Avoidance

  • D. Lomet
  • Computer Science
    IEEE Transactions on Software Engineering
  • 1980
It is shown how the subsystem approach can be applied systematically so as to approximate FIFO scheduling of resource requests, while avoiding deadlock and indefmite delay.