Re: [Neo4j] Is Neo4j graph entirely loaded into memory?
The shortest path is calculated by means of traversals. During traversal, visited nodes are read into the cache (unless those nodes are already in the cache). It is not necessarily so that the entire graph needs to be traversed to calculate the shortest path. If a path is found, other traversals don't have to continue once their path length is larger than the path already found. The larger the path between the nodes, the more completely the graph will be traversed. Date: Fri, 8 Jul 2011 11:58:52 +0200 From: lmhe...@orange.fr To: User@lists.neo4j.org Subject: [Neo4j] Is Neo4j graph entirely loaded into memory? Hi, I was wondering whether, when I calculate the shortest path between two nodes in a Neo4j graph (*), if the whole graph is loaded into memory? How does it work? Is there any literature about the way Neo4j handles such problems? Thanks for your insight. Best regards, -- Lmhelp (*) using the GraphAlgoFactory.shortestPath() method ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Is Neo4j graph entirely loaded into memory?
Thank you for your good answer. Any literature/documentation about it? All the best, -- Lmhelp On 07/08/2011 12:10 PM, Niels Hoogeveen wrote: The shortest path is calculated by means of traversals. During traversal, visited nodes are read into the cache (unless those nodes are already in the cache). It is not necessarily so that the entire graph needs to be traversed to calculate the shortest path. If a path is found, other traversals don't have to continue once their path length is larger than the path already found. The larger the path between the nodes, the more completely the graph will be traversed. Date: Fri, 8 Jul 2011 11:58:52 +0200 From: ** To: User@lists.neo4j.org Subject: [Neo4j] Is Neo4j graph entirely loaded into memory? Hi, I was wondering whether, when I calculate the shortest path between two nodes in a Neo4j graph (*), if the whole graph is loaded into memory? How does it work? Is there any literature about the way Neo4j handles such problems? Thanks for your insight. Best regards, -- Lmhelp (*) using the GraphAlgoFactory.shortestPath() method ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
