We have a really complex question: We want to find the ammount of Groups over all paths between all users. >From all User to all User. The Amount of users is 8.000 and the amount of all Groups is 15.000. This cypher request Needs days! Is there a way to make this faster?
match p=((n:i636005417297252034)-[:rel_member*0..]->x<-[:rel_member*0..]-gg-[:rel_member*0..]->(m)) where n.type="person" and m.type="person" and not gg.sAMAccountName contains '_term_' and not (n.department = m.department or n.name= "" or m.name ="" or gg.grouptype="BuiltIn_Group" or gg.commonsid="1" or gg.name="domain users") and not id(n) = id(m) return n.name , n.department, m.name, m.department, collect (distinct gg.name) order by n.name Best regards, Thomas -- 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 neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
