Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A model for concurrency in nested transactions systems
Journal of the ACM (JACM)
A simple approach to specifying concurrent systems
Communications of the ACM
The existence of refinement mappings
Theoretical Computer Science
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
The serializability of concurrent database updates
Journal of the ACM (JACM)
A new approach to developing and implementing eager database replication protocols
ACM Transactions on Database Systems (TODS)
Distributed Algorithms
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
The Database State Machine Approach
Distributed and Parallel Databases
Scalable Replication in Database Clusters
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Pronto: A Fast Failover Protocol for Off-the-Shelf Commercial Databases
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Handling message semantics with Generic Broadcast protocols
Distributed Computing
Optimistic algorithms for partial database replication
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Hi-index | 0.00 |
The deferred update technique is a widely used approach for building replicated database systems. Its fame stems from the fact that read-only transactions can execute locally to any single database replica, providing good performance for workloads where transactions are mostly of this type. In this paper, we analyze the deferred update technique and show a number of characteristics and limitations common to any replication protocol based on it. Previous works on this replication method usually start from a protocol and then argue separately that it is based on the deferred update technique and satisfies serializability. Differently, ours starts from the abstract definition of a serializable database and gradually changes it into an abstract deferred update protocol. In doing that, we can formally characterize the deferred update technique and rigorously prove its properties. Moreover, our specification can be extended to create new protocols or used to prove existing ones correct.