Thanks a lot for providing some inputs. However, for me, with the initial posting of records i.e. 3814 relations for primary and some of the secondary have 40K+ relationships, it is still not performing well - infact doesn't return.
Few questions: 1. Are you sure that with one kind of relationship between nodes, skipping the label helps? Intuitively, qualifying everything should always help.. isn't it? 2. C-->E will look for any length path? I thought it will look only for direct neighbors by default and only if I mention *1..x, it will go x deep. 3. Any idea if UNION is expected to work better than OPTIONAL MATCH clause and combining results together? Regards, - Zeeshan On Thursday, March 6, 2014 11:15:42 PM UTC-6, Ziv Unger wrote: > > As an added note, if you DID want any length of path between (a) and (c), > you can just use [r3:knows*1..x] where x is the upper limit of the path > length. If you have a lot of nodes, I would personally limit the upper > range for performance. > -- 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.
