×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

Eventually-Consistent Data Structures

by Software Engineer at Basho Techonologies, Inc. on Jun 04, 2012

  • 4,603 views

There are many reasons to use an eventually-consistent database -- like Riak, Voldemort, or Cassandra -- including increased availability, lower latency, and fault-tolerance. However, doing so ...

There are many reasons to use an eventually-consistent database -- like Riak, Voldemort, or Cassandra -- including increased availability, lower latency, and fault-tolerance. However, doing so requires a mental shift in how to structure client applications, and certain types of traditional data-structures, like sets, registers, and counters can't be resolved simply in the face of race-conditions. It is difficult to achieve "logical monotonicity" except for the most trivial data-types.
That is, until the advent of Conflict-Free Replicated Data Types (CRDTs). CRDTs are data-structures that tolerate eventual consistency. They replace traditional data-structure implementations and all have the property that, given any number of conflicting versions of the same datum, there is a single state on which they converge (monotonicity). This talk will discuss some of the most useful CRDTs and how to apply them to solve real-world data problems.

Statistics

Views

Total Views
4,603
Views on SlideShare
4,515
Embed Views
88

Actions

Likes
8
Downloads
38
Comments
0

4 Embeds 88

https://twitter.com 80
http://www.linkedin.com 4
http://coderwall.com 3
https://www.linkedin.com 1

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Apple Keynote

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

Eventually-Consistent Data Structures Eventually-Consistent Data Structures Presentation Transcript