You are viewing a plain text version of this content. The canonical link for it is here.
Posted to oak-dev@jackrabbit.apache.org by Michael Dürig <md...@apache.org> on 2013/04/05 09:57:00 UTC
Understanding Eventual Consistency
Hi,
Just found this, might be a worthwhile read [1]:
"Modern geo-replicated databases underlying large-scale Internet
services guarantee immediate availability and tolerate network
partitions at the expense of providing only weak forms of consistency,
commonly dubbed eventual consistency. At the moment there is a lot of
confusion about the semantics of eventual consistency, as different
systems implement it with different sets of features and in subtly
different forms, stated either informally or using disparate and
low-level formalisms. [...]"
Michael
[1] http://research.microsoft.com/apps/pubs/default.aspx?id=189249
Re: Understanding Eventual Consistency
Posted by Jukka Zitting <ju...@gmail.com>.
Hi,
On Fri, Apr 5, 2013 at 10:57 AM, Michael Dürig <md...@apache.org> wrote:
> Just found this, might be a worthwhile read [1]:
Yep, it's a pretty good paper.
The same research group is working on a "concurrent revisions" model
[1] that's quite similar to how the branching concept in Oak and
especially the SegmentMK. Instead of a database, they apply such ideas
to the in-memory data of a concurrent application.
[1] http://research.microsoft.com/en-us/projects/revisions/
BR,
Jukka Zitting