--- Original Message
Da: "Neo4j user discussions" <user@lists.neo4j.org>
To: "Neo4j user discussions" <user@lists.neo4j.org>
Oggetto: Re: [Neo4j] finding all shortest paths between one node and all
other nodes in a large scale databse
Data: 12/05/11 09
Thanks for all your response,
Here is the size of the grapth db:
NodesSize
-
100,000 97MB
200,000 182MB
300,000 267MB
...
5,000,000 expect 5GB
I've tried to use 5 virtual machines, each one has 2 cores and 1G memory,
Running 2 threads on each
Yes, you can probably do this thing in one traversal. Shortest path will
give you the shortest path(s) between two given nodes, but are interested in
any path, right? And you can find paths to several different end nodes in
one traversal. Just specify an Evaluator which knows about that, or let
loo
Hey JueiTing,
I'm not sure if Hadoop is needed here.
What is the current performance characteristics for the shortest path you are
using?
You could take a decent machine and just fire up, e.g. blocks of 10k node pairs
to a ThreadPoolExecutor with cores*2 threads.
Each of those tasks only has to
Hi,
Yes a Hadoop Map/Reduce job could be very well suited to this kind of
problem,
Depending on the size of your database, you could load a zipped db directory
from S3 to 20 ec2 launched instances with a bootstrap action.
You could split the traversals into 5,000,000 Mappers using each node as a
st
Hi JueiTing,
I think this is a typical case for a massive Map/Reduce job. I am thinking
of combining Hadoop works with replicas of the graph and then do the
computation. I believe Paddy Fitzgerald has been working with these
approaches and can give some feedback.
Of course, given the size of the g
Hi,
I'm trying to use Neo4j graph database to store a
large social network(more than 5,000,000 nodes) for academic research.
I need to compute the separation degree(path length) between any two nodes
in the graph then get the average degree of whole database.
The solution I'm using use now is ar
7 matches
Mail list logo
