Although this could technically be called a "distributed" key-value store, I think based on many people's assumptions of what "distributed" means, they might mi

Although this could technically be called a "distributed" key-value store, I think based on many people's assumptions of what "distributed" means, they might misunderstand what this offers. According to the FAQ, "Keyspace is a replicated system, meaning all nodes store the same data", so it's distributed in the same way as MySQL is a distributed SQL database. That is, reads scale horizontally but writes do not. That said, it appears this might be an interesting project. It appears it uses Paxos (http://en.wikipedia.org/wiki/Paxos_algorithm http://en.wikipedia.org/wiki/Paxos_algorithm) to achieve high availability. This is a good deal more sophisticated than naive replication like MySQL. Also, reads can be specified as "dirty" or not, meaning they are more performant and tolerant of failure or network partition, but also possibly inconsistent. It appears to largely sacrifice the "partition-tolerant" part of the CAP triangle. Also interesting are ranged get, atomic increment, and compare-and-swap operations.