Readings in database systems
Patterns of self-stabilization in database consistency maintenance
Data & Knowledge Engineering - Special issue: next generation information technologies and systems
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
DeeDS towards a distributed and active real-time database system
ACM SIGMOD Record
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Consistency models for distributed interactive multimedia applications
ACM SIGOPS Operating Systems Review
Properties and mechanisms of self-organizing MANET and P2P systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
FlurryDB: a dynamically scalable relational database with virtual machine cloning
Proceedings of the 4th Annual International Conference on Systems and Storage
| Hi-index | 0.00 |
Distributed databases generally have strict consistency requirements on data replicas, meaning that they are not allowed to diverge outside of transaction boundaries. For certain applications, this is too pessimistic, and it is often better to trade off consistency for higher availability, performance, or predictability. In this paper, we describe a replication protocol for a distributed database which is eventually consistent; it allows replicas to diverge if the system can be guaranteed to eventually converge to a consistent state. We also compare eventual consistency to self-stabilization, and outline how self-stabilization theory may help in proving properties of eventually consistent systems.