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



What Are Some Good MapReduce Implementations for Graphs?

In case you were wondering how some problems Hadoop and MapReduce are not best at solving, there’s a great Q&A on

MapReduce is good at distributed computing, but not for graph algorithms. Is there a general-use, highly-distributed open source graph framework? I’m especially interested in hearing about in-practice use cases, and how good/bad they were.

Ankur Dave’s answer is quite compehensive, listing 5 specialized solutions and 3 generic frameworks:

  • Giraph
  • GraphLab
  • Phoebus
  • Golden Orb
  • Signal/Collect
  • Spark
  • Piccolo
  • HaLoop

I was not aware of all these solutions, so more to read for me.

Original title and link: What Are Some Good MapReduce Implementations for Graphs? (NoSQL database©myNoSQL)