A fully-distributed approach to concurrency control in replicated database systems

Existing algorithms for concurrency control in replicated database systems are semi-distributed because, in these algorithms, only one site completely executes an update and the other sites just commit its writes. The author presents a fully distributed algorithm for concurrency control where each site completely executes every update. This approach has improved resiliency to different kinds of failures, higher parallelism, fast response to user requests, and low communication overhead. The author also presents a performance model of a replicated database system and uses it to study the performance of the proposed algorithm and the algorithm of M. Singhal et al. (1986). The results of the performance study reveal that the proposed approach improves the performance at the cost of nominal I/O overhead.<<ETX>>

[1]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[2]  J. D. Day,et al.  A principle for resilient sharing of distributed resources , 1976, ICSE '76.

[3]  Philip A. Bernstein,et al.  An algorithm for concurrency control and recovery in replicated distributed databases , 1984, TODS.

[4]  Michael Stonebraker,et al.  Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres , 1979, IEEE Transactions on Software Engineering.

[5]  Kenneth P. Birman,et al.  Low cost management of replicated data in fault-tolerant distributed systems , 1986, TOCS.

[6]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[7]  Wesley W. Chu,et al.  A Distributed Control Algorithm for Reliably and Consistently Updating Replicated Databases , 1980, IEEE Transactions on Computers.

[8]  Christos H. Papadimitriou,et al.  The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case) , 1978, IEEE Transactions on Software Engineering.

[9]  Hector Garcia-Molina,et al.  Performance Comparison of Two Update Algorithms for Distributed Databases , 1978, Berkeley Workshop.

[10]  Wesley W. Chu,et al.  The Exclusive-Writer Approach to Updating Replicated Files in Distributed Processing Systems , 1985, IEEE Transactions on Computers.

[11]  Clarence A. Ellis,et al.  Consistency and correctness of duplicate database systems , 1977, SOSP '77.

[12]  Flaviu Cristian,et al.  An efficient, fault-tolerant protocol for replicated data management , 1985, Fault-Tolerant Distributed Computing.

[13]  Joost Verhofstad,et al.  Recovery Techniques for Database Systems , 1978, CSUR.

[14]  Susan B. Davidson,et al.  Optimism and consistency in partitioned distributed database systems , 1984, TODS.

[15]  Gérard Le Lann,et al.  Algorithms for Distributed Data-Sharing Systems Which Use Tickets , 1978, Berkeley Workshop.

[16]  Mukesh Singhal,et al.  A Concurrency Control Algorithm and Its Performance for Replicated Database Systems , 1986, ICDCS.

[17]  Milan Milenkovic.  Synchronization of Concurrent Updates in Redundant Distributed Databases , 1980, DDB.

[18]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[19]  Flaviu Cristian,et al.  An efficient, fault-tolerant protocol for replicated data management , 1985, PODS '85.

[20]  Geneva G. Belford,et al.  Update Synchronization in Distributed Databases , 1980, VLDB.

[21]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[22]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.