Using Neo4j + MapReduce

[Mohana Krishna, IIT Bombay, India]

Hello,

Is there a way to run parallel graph algorithms using map-reduce paradigm on a graph represented in Neo4j. Like if I wish to run a map-reduce version of Bron-Kerbosch algorithm to enumerate all maximal cliques in a graph represented in Neo4j, is there a way?

Please provide some pointers/examples. Thanks in advance.

[Michael Hunger]

There is no "map-reduce" out of the box, but you can develop concurrent pretty easily.

My colleague Max started a project around this: 

https://github.com/maxdemarzi/graph_processing

Where you can find implementations for some algorithms using concurrent approaches.

Could you write in pseudo code what the map-and-reduce steps would look like for this algorithm?

Then I could give you a few pointers on how to do it.

Thanks Michael

--
You received this message because you are subscribed to the Google Groups "Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+un...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.