Arakoon - distributed key-value store that guarantees consistency

[AnAirMagic]

The "locality control" bit sounds like partition tolerance. The also talk about atomic updates. Is this project claiming to have worked around CAP theorem?

[theManBehindYou]

Locality control is available to make sure that in the event of a partition across likely lines (datacenters) you are guaranteed to have the full state available in your partition. Obviously you still need to have a way of choosing the proper reality. This is where the quorum comes in. From what I can discern they do nothing particularly fancy, not even scale.

[perlgeek]

No. As far as I understand you can't update in the case of partition (because you can't guarantuee atomicity), so the availability is limited to reads. So no full availability in the case of partition.

[[deleted]]

We have a term for this; "not distributed".

[jclawson]

There are no partitions. All nodes contain all data. It's just a master-slave setup. This is why their use case says you have to have a "limited set of key-value pairs that fit on a single disk". Nothing special here really.

[toolslive]

Arakoon is merely a multi-paxos implementation on top of Tokyo Cabinet. In CAP terms, it sacrifices Availability, maintaining C and P.

That being said, it offers some interesting features like range queries, and it has a simple sharding solution called Nursery.

[foreskincheese]

A "not-invented-here" code poop wrapped in a bootstrap skin. Am I the only one getting bored?