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



Hadoop Doesn’t Solve All Problems

Very good points about some problem areas where Hadoop is not that useful:

Map-reduce performs poorly on algorithms that rely on intra-data relationships. For example, clustering algorithms are supposed to find geometric regions of data. To pull this off, the algorithm must effectively compare every data point with every other data point. These intra-data relationships are the death nail for Hadoop. Map-reduce fundamentally struggles to compare datapoints with other datapoints.

Consider another example: recommendations. A recommendation engine is an implementation of a clustering algorithm. Although it’s possible to run this on Hadoop, our experience has shown that it takes six times longer than a non-Hadoop implementation.

Original title and link: Hadoop Doesn’t Solve All Problems (NoSQL database©myNoSQL)