Re:Agamemnon 0.3.0.0: A graph database built on top of cassa...
by rjurney on Tuesday August 09, 2011 @12:39AM
(#2862920)
It's going to be slow for global algorithms in large graphs, and fast for local traversals in any graph. Which is the best you can hope for, and they're probably close to the state of the art at doing both in one DB.
I'm somewhat skeptical of the practicality of a graph database backed by a network-connected datastore (as distinct from a graph database exposed over a network interface, ie: neo4j) due to the inevitable latency when traversing the graph.
Also the practicality of scale-out using an ostensibly sharded datastore (cassandra) for a structure that's notoriously difficult to shard meaningfully (graph).