BASE Transaction
Jump to navigation
Jump to search
A BASE Transaction is a database transaction that is an eventually consistent transaction and a ...
- …
- Counter-Example(s):
- See: Consistent Transaction, NoSQL Database Management System.
References
2012
- http://en.wikipedia.org/wiki/Eventual_consistency
- QUOTE: Eventual consistency is one of the consistency models used in the domain of parallel programming, for example in distributed shared memory, distributed transactions, and optimistic replication.[1][2] It means that given a sufficiently long period of time over which no changes are sent, all updates can be expected to propagate eventually through the system and all the replicas will be consistent. While some authors use that definition (e.g. Vogels), others prefer a stronger definition that requires good things to happen even in the presence of continuing updates, reconfigurations, or failures. In the Terry et al. work referenced above, eventual consistency means that for a given accepted update and a given replica, eventually, either the update reaches the replica, or the replica retires from service.
In database terminology, this is known as BASE (Basically Available, Soft state, Eventual consistency), as opposed to the database concept of ACID.[3]
- QUOTE: Eventual consistency is one of the consistency models used in the domain of parallel programming, for example in distributed shared memory, distributed transactions, and optimistic replication.[1][2] It means that given a sufficiently long period of time over which no changes are sent, all updates can be expected to propagate eventually through the system and all the replicas will be consistent. While some authors use that definition (e.g. Vogels), others prefer a stronger definition that requires good things to happen even in the presence of continuing updates, reconfigurations, or failures. In the Terry et al. work referenced above, eventual consistency means that for a given accepted update and a given replica, eventually, either the update reaches the replica, or the replica retires from service.
- ↑ W. Vogels. Eventually Consistent. ACM Queue vol. 6, no. 6, December 2008.
- ↑ D. B. Terry, et. al. Managing update conflicts in Bayou, a weakly connected replicated storage system ACM SOSP, December 1995.
- ↑ D. Pritchett [1]. ACM Queue vol. 6, no. 3, July 28, 2008.