I have a small size graph containing 20k nodes and around 500k edges. Each node is connected to its related one with bi directional relationship. I need to find paths which takes me to the original node and through nodes which are not directly connected with each other
match p = me-[*3..7]-me Return p limit 5 me represents the indexed node This query takes more than 5 minutes on 8 GB Quad core machine Is anything can be done to speed up the performance. Each node on the average is connected to 40 other nodes -- 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.
