title: Extensions for Computationally-Intensive Cypher queries
body: <p>As a follow up to a <a href="https://stackoverflow.com/questions/17601152/limiting-cypher-queries">previous question of mine</a>, I want to find all 30 pathways that exist between two given nodes within a depth of 4. Something to the effect of this:</p>
  
  <pre><code>start startnode = node(1), endnode(1000)
  match startnode-[r:rel_Type*1..4]-&gt;endnode
  return r
  limit 30;
  </code></pre>
  
  <p>My database contains ~50k nodes and 2M relationships.</p>
  
  <p>Expectedly, the computation time for this query is very, very large; I even ended up with the following GC message in the <code>message.log</code> file: <code>GC Monitor: Application threads blocked for an additional 14813ms [total block time: 182.589s]</code>. This error keeps occuring, and blocks all threads for an indefinite period of time. Therefore, I am looking for a way to lower the computational strain of this query on the server by optimizing the query.</p>
  
  <p><em>Is there any extension I could use to help optimize this query?</em></p>