Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

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

Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

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

Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

Da: Neo4j user discussions lt;user@lists.neo4j.orggt; To: Neo4j user discussions lt;user@lists.neo4j.orggt; Oggetto: Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse Data: 12/05/11 09:30 Thanks for all your response, Here

Re: [Neo4j] finding all shortest paths between one node and all other nodes in a large scale databse

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