What makes this graph database "highly scalable, distributed"?<p>There are difficult theoretical computer science problems that effectively limit the parallelization/distribution of generalized graph operators. To achieve high scalability you have to solve these computer science problems first. If this design offers a novel solution to the longstanding computer science problem then kudos, but nothing at the site suggests this is the case.<p>Many graph databases have claimed high scalability and distributability but none of those claims have held up over time due to the aforementioned computer science problems. This may be a very nice graph database but I am skeptical of the claims of "highly scalable, distributed" unless there is evidence that it uses fundamentally new theoretical computer science to achieve that.
We are going to address alot of these questions in our presentation tonight. However, for the Hacker News crew that won't be there tonight, here is an early release of the Titan talk.<p><a href="https://speakerdeck.com/u/okram/p/titan-the-rise-of-big-graph-data" rel="nofollow">https://speakerdeck.com/u/okram/p/titan-the-rise-of-big-grap...</a><p><a href="http://titanbiggraphdata.eventbrite.com/" rel="nofollow">http://titanbiggraphdata.eventbrite.com/</a><p>Enjoy!,
Marko.
Very interesting. Since it implements Blueprints, does it also have support for Furnace (graph algorithms)? If so, does this imply that graph processing is done on disk rather than in-memory? I am rather unfamiliar with Blueprints but I'm wondering how Titan implements that aspect.
I don't want to spam this thread, but I feel I have to plug my personal pet project Related (<a href="https://github.com/sutajio/related" rel="nofollow">https://github.com/sutajio/related</a>), since it is, well.. yeah... "related" to the topic being discussed.<p>It can't do half of what Titan does and is a much, much simpler design. But it is fast, easy to use and works really well for 80% of the use cases you might have for a graph database on the web (social graphs, semantic web stuff, etc.)
Also,<p>What is interesting about a graph database relative to simple key-value database? Storing edges of a graph is trivial for a key-value store and so it seems like any key-value store could let store the basic graph structure?<p>Do graph databases support graphic-specific queries and indices?
"Vertex-centric indices provide vertex-level querying to alleviate issues with the infamous super node problem"<p>Does that mean, for each vertex, is it's sub-graph indexed?!