Do you really want to find all paths? If so you will probably find hundreds of millions of paths.
As you seem to want to see only the shortest path, please use the shortest path algorithm: > start n=node(42),m=node(31) match p=shortestPath(n-[*]->m) return p,length(p) Am 01.05.2014 um 03:20 schrieb Kaan KILIÇ <[email protected]>: > I need to breath first search in my database there is 3.863 nodes,2.830.471 > properties and 1.355.783 relationships.N is my start point and m is my end > point in the query but It's too much slow (I Mean 30 mins), so I can't get > result while I started the query that is in the following segment: > > start n=node(42),m=node(31) match p=n-[*1..]->m return p,length(p) order > by length(p) asc limit 1 > > > > How can I optimize that query? Because It must finish maximum in 20 seconds.I > have 8gb ram in my own computer but I bought 24 Gb ram dedicated server for > that.Also, My heap size is 4096-5120 MB.Also there is my other configs which > is about query in the following segment: > > neostore.nodestore.db.mapped_memory=2024M > neostore.relationshipstore.db.mapped_memory=614M > neostore.propertystore.db.mapped_memory=128M > neostore.propertystore.db.strings.mapped_memory=2024M > neostore.propertystore.db.arrays.mapped_memory=614M > > > > How can solve this problem? > > Thanks for interest, kind regards. > > -- > 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. -- 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.
