I am using Neo4j to create a chess games database. The nodes are chess positions from different games. I am trying to find similarity between positions and i use labels for that. Each Label represent one piece in every different position on the board (total 732 labels). So one position may consist from at least 2 labels (For Kings) to maximum 32 label for the initial position.
With the querry i try to find all the games that have some specific pieces in particular positions. I have tried to start from the smallest label in the querry to limit the search but the response time only improved about 10%. Τη Πέμπτη, 16 Ιανουαρίου 2014 12:12:23 π.μ. UTC+2, ο χρήστης [email protected] έγραψε: > > Hi all, > > I have a databese with 15 million nodes. Also i have 750 different labels. > Every node may have 5-32 labels. > When i execute the querry > > MATCH (n:Labe1:Label2:......:Label20) > RETURN n > > the response time is really slow. Its about 200-400 sec. Is something i > can do to improve this performance? > -- 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/groups/opt_out.
