NOSQL DB concurrency

Optimistic Concurrency, also known as MVCC (Multi-Version
Concurrency Control).


This mechanism relies on timestamps (presupposing a shared
clock) or Vector Clocks, as described in [Lamport, 1978], to determine the modification
dates of transactions. In a nutshell, when transaction A begins, it reads the timestamps of
the entity or entities it wishes to modify. It then does its computations, and prepares its
write. Just before writing, it checks the timestamp of the values again and looks to see if a
conflicting transaction (transaction B) has updated the values. If so, the write would be in
conflict, and its changes are rolled back and forced to start again from scratch.


Optimistic Concurrency has several properties that make it an ideal choice for
large scale distributed database implementations. In opposition to locking mechanisms,
reads are never blocked, which can be important if the access pattern of the application
calls for large amounts of reads (as many queries in the map/reduce paradigm do).
MVCC is very good at achieving true "snapshot" isolation, because a query can carry
with it a timestamp that is used to filter any entity the query touches; this is true not only
in short terms "near" queries, but also equally effective in reconstructing historical
snapshots.
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值