Hacker News new | past | comments | ask | show | jobs | submit login

It's cool to see graph DBs like Titan and Neo4j moving up the ranks.

There are some major advancements coming down the pipe in the world of open-source graph computing that will make working with big graph data accessible to anyone, not just the Googles, Facebooks, and Twitters of the world.

Here are some of the things coming down the pipe:

Titan 0.4 was just released https://github.com/thinkaurelius/titan), and the number of backend datastores Titan supports is growing. Datagrid support was just added for Hazelcast, and it can serve as the reference implementation if anyone wants to add support for Infinispan, Galaxy (http://puniverse.github.io/galaxy/), or one of the other datagrids.

MapR is in the final stages of certifying Titan on M7 Tables (https://groups.google.com/d/msg/aureliusgraphs/RTeFVssIvoI/m...), which will allow you to run Titan on HBase without all the HBase complexity. AWS (http://aws.amazon.com/elasticmapreduce/mapr/) and GCE (http://www.mapr.com/products/google-cloud-platform) already have direct support for M7 so it's easy to spin up a cluster.

TinkerPop3 is scheduled for release within the next six months (https://github.com/tinkerpop/tinkerpop3/wiki), and it will blur the lines between graph databases and graph processing engines.

Marko just released the first version of TinkerPop3's OLAPGraph -- this is Blueprints for graph-processing engines, which means that in addition to OLTP graph databases like Titan and Neo4j, TinkerPop3 will support OLAP engines like Giraph, HAMA, Faunus, GraphLab, and the new GraphX engine in Spark (http://amplab.github.io/graphx/, http://www.youtube.com/watch?v=mKEn9C5bRck&list=PLbDk7g7PotW...).

You'll be able to run Gremlin over any Blueprints-enabled graph-database or graph-processing engine, and Gremlin will be able to jump between the database and processing engine, depending on if it's a local or global graph algorithm (http://markorodriguez.com/2011/04/19/local-and-distributed-t...).

And Marko's recent breakthrough on swarm computing over derived graphs (https://groups.google.com/d/msg/gremlin-users/1KObZ8F2d00/CJ...) means you'll be able to run traditional graph algos over property graphs. This will pave the way for the community to construct a massive library of graph algorithms in Gremlin (https://github.com/tinkerpop/furnace/wiki).

All of this is coming together now. 2014 will see a major leap in open-source graph computing.




I understand very little of what you just posted, but purely because of my own ignorance. This is wonderful, I now have a reference doc on what to read up on this weekend. HN FTW.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: