NoSQL Benchmarks NoSQL use cases NoSQL Videos NoSQL Hybrid Solutions NoSQL Presentations Big Data Hadoop MapReduce Pig Hive Flume Oozie Sqoop HDFS ZooKeeper Cascading Cascalog BigTable Cassandra HBase Hypertable Couchbase CouchDB MongoDB OrientDB RavenDB Jackrabbit Terrastore Amazon DynamoDB Redis Riak Project Voldemort Tokyo Cabinet Kyoto Cabinet memcached Amazon SimpleDB Datomic MemcacheDB M/DB GT.M Amazon Dynamo Dynomite Mnesia Yahoo! PNUTS/Sherpa Neo4j InfoGrid Sones GraphDB InfiniteGraph AllegroGraph MarkLogic Clustrix CouchDB Case Studies MongoDB Case Studies NoSQL at Adobe NoSQL at Facebook NoSQL at Twitter



Consistent Hashing Explained: The What and the Why

Two nightd ago (and after a couple of beers), it took me about 10 minutes to explain what is consistent hashing and its benefits to a guy until he got the “aha” moment. But if I’d have to explain it in a more formal way and provide references I’d use Mathias’ post.

Consistent hashing

The simplicity of consistent hashing is pretty mind-blowing. Here you have a number of nodes in a cluster of databases, or in a cluster of web caches. How do you figure out where the data for a particular key goes in that cluster? […] Consistent hashing solves the problem people desperately tried to apply sharding to pretty nicely and elegantly.

Original title and link: Consistent Hashing Explained: The What and the Why (NoSQL database©myNoSQL)