Hi, We're currently using a Neo4j database with 3,7 million nodes and 244 million relationships. However we are facing a problem using the shortest path algorithms "ShortestPath" from graph-algo 0.6.
Our server has a 2.8Ghz Core 2 Duo processor and 4 GB of RAM installed. Starting a shortest-path search between two arbitrary nodes can take up to half an hour. Calling the search for the second time using the same nodes it finishes in milliseconds. 2 things make me wonder: 1. Is there a way to load parts of the database into memory prior to the first search (preloading)? 2. Running the search algorithm only uses 2% of CPU/0,5MB/s read from disk. So there are resources left that are unused. What can I do to find the bottleneck? Greetings, Toby _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
