Hi, my Graph question is: "Which Player played most frequently against each other"
I queried following Cypher: match (p:Player)-[:PLAYS_IN]->(t:Team)-[:PLAYED]->(g:Game)<-[:PLAYED]-(tt:Team)<-[:PLAYS_IN]-(pp:Player) USING SCAN p:Player USING SCAN pp:Player return p.Lastname, pp.Lastname, count(pp) order by count(pp) desc limit 100; Number of Player: 158310 Game: 215068 Team: 218960 Heap is 6G, CPU are 4 cores. This Query does take hours and does not finish. How should i optimize it? Thanks, Michael -- 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.
