Coolio,
let us know when you get going on this, would be superinteresting to
see more of your thoughts!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter
No problem, I plan to make the code available for free, but there's currently
no code, so I'll publish the location of the code repository when I'll write
some.. :)
--
View this message in context:
Mmh,
I would actually do it the other way round - have a number of
replicated Neo4j instances (possibly via Neo4j HA, see
http://docs.neo4j.org/chunked/snapshot/ha-setup-tutorial.html) and
then push traversals via GoldenOrb onto these instances and merge the
results.
WDYT?
Cheers,
/peter
You can try to implement Google Pregel
http://dl.acm.org/citation.cfm?id=1807167.1807184 algorithm on top of Neo4j
or use existing implementation http://www.goldenorbos.org/
On Tue, Oct 11, 2011 at 3:26 PM, amitp amit.port...@gmail.com wrote:
Hey,
- I'm designing a P2P application in which
Hey thanks,
I've just read goldenOrb wiki, it's seem related BUT if I understand
correctly it's helps just with the distribution. I'm looking for a more
complete graph package that can be easily distributed (I don't want to
implement my own query engine).
So I think I'll need to get into the
5 matches
Mail list logo
