Filter nodes by its degree

[Zhixuan Wang]

I found my query always got stuck at expanding some messy nodes with hundreds of indegrees. I am wondering if on each node we have some hidden property that tells the number of degrees of that node?

I believe with the concept of "index free adjacency" there should be a way of knowing the node degrees without actually going out to read every node it is connected to.

Any comments/suggestions would be greatly appreciated.

Thanks,

[Max De Marzi Jr.]

Oh yeah. We keep track of them.  

You can use SIZE((node)-[:reltype]->()) in Cypher. 

MATCH (n:User {id:'max'})

RETURN SIZE((n)--()) AS all, SIZE((n)-->()) AS out, SIZE((n)<--()) AS in, SIZE((n)-[:FRIENDS]-()) AS allType, SIZE((n)-[:FRIENDS]->()) AS outType, SIZE((n)<-[:FRIENDS]-()) AS inType

In Java you have node::getDegree(). See https://maxdemarzi.com/2017/04/04/building-a-twitter-clone-with-neo4j-part-three/ for example of using it.

[Zhixuan Wang]

thanks Max, that is exactly what I want