neo4j query performance - getting nodes with degree >1

Question

match (n:A)-[r:Transaction]-(m:B) with n,count(r) num where num>1 return n

There are 100M nodes and 250M relations in the graph. The above query is a simple group by in a relational DB and returns in < 5mins. It takes forever in Cypher, any ideas what can make it faster

Answer 1

So you want nodes of type A that have more than one :Transaction relationship with one or more nodes of type B?

Try

MATCH (n:A) WHERE size((n:A)-[:Transaction]-(m:B)) > 1
RETURN n

Check out this blog post for more on efficient relationship counting.