Hi Michael, We try to answer to your question : In our graph we have only geo-nodes (we are create a routing machine so we read the osm file and create nodes in neo4j);
Generally findClosestPointsTo method returns a range of nodes number between 10 and 150. We saw that the first time we call the method it takes a long time to be executed (min 30s - max 180s). On the next calls the method is faster (min 148 millis - max 650 millis), but after sometimes it became again slow. We tested it windows 7 and ubuntu 12.04.04 both of them 64 bit This is neo4j configuration : nodestore_mapped_memory_size=100M relationshipstore_mapped_memory_size=3G nodestore_propertystore_mapped_memory_size=100M strings_mapped_memory_size=200M arrays_mapped_memory_size=50M keep_logical_logs=true ps. we need the schema index because we need to o same chyper query on same node propertis (like x, y, and giunzioneDbId) Thank you, Angelo & Antonio Il giorno mercoledì 16 aprile 2014 17:59:38 UTC+2, Antonio Grimaldi ha scritto: > > Hi, > We are using Neo4J 2.0 embedded and have a Graph with around 1 Million of > Nodes, and 50 Million of relationships; > When > call org.neo4j.gis.spatial.SimplePointLayer.findClosestPointsTo(Coordinate, > double), to get all closest node from a given point, we have very low > performance. > Is there a reason for this? or is there any other faster way? > > Thanks > Antonio > -- 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.
