On Mon, May 19, 2014 at 7:41 PM, Angelo Immediata <[email protected]> wrote: > > We tried to execute the AStar algorithm between 2 points. The distance > between points is around 130 kilometers. In order to execute the algorithm > > Neo4j takes around 4 seconds for returning a path and it seems to me really > too much; if i compare it to other software on the same OSM I have > really really really really different performance.
Other software usually don't use just A*, they also implement Contraction hierarchies (http://en.wikipedia.org/wiki/Contraction_hierarchies), you should try to do the same on Neo4j. -- Davide Savazzi -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
