Database Replication: If You Must be Lazy, be Consistent

Authors:
JoAnne Holliday;Divyakant Agrawal;Amr El Abbadi
Affiliations:
-;-;-
Venue:
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Year:
1999

Citing 5
Cited 1

Concurrency control performance modeling: alternatives and implications

Performance of concurrency control mechanisms in centralized database systems
The dangers of replication and a solution

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Epidemic algorithms in replicated databases (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Replication, consistency, and practicality: are these mutually exclusive?

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient solutions to the replicated log and dictionary problems

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

Analysis of the abortion rate on lazy replication protocols

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Due to severe performance penalties associated with synchronous replication, there is a significant interest in asynchronous replica management protocols. Lazy protocols currently in use either do not guarantee consistency and serializability as needed by transactional semantics or they impose restrictions on placement of data and which data object can be updated. In this paper we consider an alternative update protocol based on epidemic communication that guarantees consistency and serializability in spite of a write-anywhere capability.