A classification of update methods for replicated databases

In this paper we present a classification of the methods for updating replicated databases. The main contribution of this paper is to present the various methods in the context of a structured taxonomy, which accommodates very heterogeneous methods. Classes of update methods are presented through their general properties, such as the invariants that hold for them. Methods are reviewed both in their normal and abnormal behaviour (e.g., after a network partition). We show that several methods presented in the literature, sometimes in independent papers with no cross-reference, are indeed very much related, for instance because they share the same basic technique. We also show in what sense they diverge from the basic technique. This classification can serve as a basis for choosing the method that is most suitable to a specific application. It can also be used as a guideline to researchers who aim at developing new mechanisms.

[1]  Toshimi Minoura,et al.  Resilient Extended True-Copy Token Scheme for a Distributed Database System , 1982, IEEE Transactions on Software Engineering.

[2]  Andreas Reuter,et al.  The ConTract Model , 1991, Database Transaction Models for Advanced Applications.

[3]  Hector Garcia-Molina,et al.  The Demarcation Protocol: A Technique for Maintaining Linear Arithmetic Constraints in Distributed Database Systems , 1992, EDBT.

[4]  Divyakant Agrawal,et al.  Efficient techniques for replicated data management , 1990, [1990] Proceedings. Workshop on the Management of Replicated Data.

[5]  David A. Bell,et al.  Distributed database systems , 1992 .

[6]  Guy M. Lohman,et al.  Differential files: their application to the maintenance of large databases , 1976, TODS.

[7]  Calton Pu,et al.  Replica control in distributed systems: as asynchronous approach , 1991, SIGMOD '91.

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

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

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

[11]  Hector Garcia-Molina,et al.  Management of a remote backup copy for disaster recovery , 1991, TODS.

[12]  M. Anderton,et al.  Distributed computer systems: Four case studies , 1987, Proceedings of the IEEE.

[13]  Hector Garcia-Molina,et al.  The case for controlled inconsistency in replicated data , 1990, [1990] Proceedings. Workshop on the Management of Replicated Data.

[14]  Stefano Ceri,et al.  Advances in Database Technology—EDBT '88 , 1988, Lecture Notes in Computer Science.

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

[16]  Divyakant Agrawal,et al.  The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data , 1990, VLDB.

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

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

[19]  Akhil Kumar,et al.  Optimizing Voting-Type Algorithms for Replicated Data , 1988, EDBT.

[20]  Charles W. Kaufman,et al.  Using History Information to Process Delayed Database Updates , 1986, VLDB.