Data Structures in Riak

A session at RICON 2012

Thursday 11th October, 2012

11:00am to 11:45am (PST)

Since the beginning, Riak has supported high write-availability using Dynamo-style multi-valued keys – also known as conflicts or siblings. The tradeoff for this type of availability is that the application must include logic to resolve conflicting updates. While it is convenient to say that the application can reason best about conflicts, ad hoc resolution is error-prone and can result in surprising anomalies, like the reappearing item problem in Dynamo’s shopping cart.

What is needed is a more formal and general approach to the problem of conflict resolution for complex data structures. Luckily, there are some formal strategies in recent literature, including Conflict-Free Replicated Data Types (CRDTs) and BloomL lattices. We’ll review these strategies and cover some recent work we’ve done toward adding automatically-convergent data structures to Riak

About the speakers

This person is speaking at this event.
Russell Brown

Engineer, Basho Technologies

This person is speaking at this event.
Sean Cribbs

Engineer, Basho Technologies

Coverage of this session

Sign in to add slides, notes or videos to this session

Tell your friends!

When

Time 11:00am11:45am PST

Date Thu 11th October 2012

Short URL

lanyrd.com/sxgfy

Official session page

basho.com/…2012/#sean-russell-talk

View the schedule

Share

Topics

See something wrong?

Report an issue with this session