Maintaining availability in partitioned replicated databases

In a replicated database, a data item may have copies residing on several sites. A replica control protocol is necessary to ensure that data items with several copies behave as if they consist of a single copy, as far as users can tell. We describe a new replica control protocol that allows the accessing of data in spite of site failures and network partitioning. This protocol provides the database designer with a large degree of flexibility in deciding the degree of data availability, as well as the cost of accessing data.

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

[2]  Vassos Hadzilacos,et al.  Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing) , 1985 .

[3]  Amr El Abbadi.  A Paradigm for Concurrency Control Protocols for Distributed Databases , 1987 .

[4]  Hector Garcia-Molina,et al.  Consistency in a partitioned network: a survey , 1985, CSUR.

[5]  David Dixon Wright,et al.  Managing Distributed Databases in Partitioned Networks , 1984 .

[6]  Philip A. Bernstein,et al.  The failure and recovery problem for replicated databases , 1983, PODC '83.

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

[8]  Mohamed G. Gouda,et al.  Independent Recovery , 1987, SRDS.

[9]  Maurice Herlihy,et al.  Dynamic quorum adjustment for partitioned data , 1987, TODS.

[10]  Brian A. Coan,et al.  Limitations on database availability when networks partition , 1986, PODC '86.

[11]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[12]  Stephen Fox,et al.  A recovery algorithm for a distributed database system , 1983, PODS.

[13]  David P. Reed,et al.  Implementing atomic actions on decentralized data , 1983, TOCS.

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

[15]  Dale Skeen,et al.  Increasing availability in partitioned database systems , 1984, Adv. Comput. Res..

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

[17]  C. H. Papadimitriou.  SERIALIZABILITY OF CONCURRENT DATA BASE UPDATES , 1979 .

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

[19]  Irving L. Traiger,et al.  The Recovery Manager of the System R Database Manager , 1981, CSUR.

[20]  Derek L. Eager,et al.  Achieving robustness in distributed database systems , 1983, TODS.

[21]  Amr El Abbadi,et al.  Availability in partitioned replicated databases , 1985, PODS.

[22]  P BirmanKenneth,et al.  Low cost management of replicated data in fault-tolerant distributed systems , 1986 .

[23]  Sam Toueg,et al.  Distributed agreement in the presence of processor and communication faults , 1986, IEEE Transactions on Software Engineering.

[24]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.