I think what you wanted to do was to set an upper limit? START a=node(41789), b=node(1513155) MATCH p=(a)-[*..2]-(b) return p;
and perhaps even: START a=node(41789), b=node(1513155) MATCH p=shortestPath((a)-[*..2]-(b)) return p; Otherwise without limits Cypher goes off for you finding all the hundreds of billions of possible paths between the two nodes :) On Sat, May 31, 2014 at 4:58 AM, John Fry <frydom.j...@gmail.com> wrote: > Hi All, > > here is an example of the problems I am having. > graph is ~11M nodes; ~100M rels. The graph is densely connected with > outdegrees in the range 5-30. > > The query below hits the heap limit quickly and thrashes the GC. > > Any advice? > > Regards, John > > START a=node(41789), b=node(1513155) > MATCH p=a-[*2]-b > return p; > > > <https://lh6.googleusercontent.com/-V6aXl5C-vsw/U4lEwAIcEgI/AAAAAAAAEUg/izBS_mw6vow/s1600/Screen+Shot+2014-05-30+at+7.52.40+PM.png> > > > > > -- > 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 neo4j+unsubscr...@googlegroups.com. > 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 neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
