I am novice to Graph Databases and struggling to process 1M relationships using the below query. I have observed that the below query is using only 1 core and is taking too long. Is it possible to run the query in parallel using all cores available? I came across AOPC function apoc.cypher.parallel2 and not sure if it can do the trick. I am using the community version but open to upgrade to Enterprise version if I can get it to run in parallel.
MATCH p=(a:address)-[r*]->(b:address)
WHERE NOT (b)-[]->(:address)
WITH a,b, LAST(nodes(p)) as c,length(p) as depth
RETURN a.add_id, c.add_id,max(depth)
ORDER BY a.add_id
;
Thanks in advance.