Improved optimistic concurrency control and its use in distributed database systems

The original optimistic concurrency control scheme (H.T. Kung, and J.T. Robinson, 1979) has weaknesses with respect to the validation technique, the treatment of long transactions, and the problem of starvation. Some alternatives for the validation-phase are considered that not only avoid these disadvantages but also improve the performance of the original approach. Most promising is a technique which supports read-transactions, thereby decreasing the number of backups substantially. An adaptation of a centralized optimistic concurrency control scheme to a distributed environment is presented. The proposed algorithm is deadlock-free and offers high parallelism.<<ETX>>

[1]  Sreekaanth S. Isloor,et al.  An effective "on-line" deadlock detection technique for distributed data base management systems , 1978, COMPSAC.

[2]  Irving L. Traiger,et al.  Transactions and consistency in distributed database systems , 1982, TODS.

[3]  H. T. King,et al.  On Optimistic Methods For Concurrency Control , 1979, VLDB 1979.

[4]  Bharat K. Bhargava,et al.  Classes of Serializable Histories and Synchronization Algorithms in Distributed Database Systems , 1982, ICDCS.

[5]  Gunter Schlageter,et al.  Redesign of optimistic methods: Improving performance and applicability , 1986, 1986 IEEE Second International Conference on Data Engineering.

[6]  MARTIN L. KERSTEN,et al.  Application of an optimistic concurrency control method , 1984, Softw. Pract. Exp..

[7]  Daniel A. Menascé,et al.  Optimistic versus pessimistic concurrency control mechanisms in database management systems , 1982, Inf. Syst..

[8]  Gunter Schlageter,et al.  Less optimism about optimistic concurrency control , 1992, [1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing.

[9]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[10]  M. Tamer Özsu,et al.  Performance comparison of resilient concurrency control algorithms for distributed databases , 1986, 1986 IEEE Second International Conference on Data Engineering.

[11]  Michael J. Carey.  Improving the Performance of an Optimistic Concurrency Control Algorithm Through Timestamps and Versions , 1987, IEEE Transactions on Software Engineering.

[12]  Daniel A. Menascé,et al.  Locking and Deadlock Detection in Distributed Data Bases , 1979, IEEE Transactions on Software Engineering.

[13]  J. T. Robinson,et al.  A framework for understanding distributed (deadlock detection) algorithms , 1983, PODS '83.