Hi all, We have a graph database with 8 million nodes and 50 million relationships. We need to find out nodes with maximum relationships in descending order. The code
start n=node(*) match (n)-[r]-() return n, count(r) as rel_count order by rel_count desc limit 25 is taking a lot of time. Is there any way to do it quickly? -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
