Question

Is it possible to take a large subset of nodes and sort them by total relationships? Or to put it another way, is it possible to return a large resultset from neo4j with the most connected nodes at the top?

Answer 1

You could try

START node=node(*) 
MATCH node-[rel]-() 
RETURN id(node) as id, count(rel) as count 
ORDER BY count DESC

See this sample database: http://console.neo4j.org/r/c3tfc3