Hi, I was searching on forums how to match nodes with other nodes when I saw a message where you mentioned patterns.
I am very new to the world of graph databases and if you have a little time I would be glad if you could answer this question. I would like to match receits nodes with bank accounts statement entry nodes. in the 2 examples, br2 [bank receit number2] matches bs1 [bank statement entry number1] What would be the most efficient model to match the nodes ? example1.png shows 2 trees with one level example2.png shows 2 lists where each entry has a next entry [here my undestanding that we exploit the tranversal speed] The basic idea is to take the first receit node and compare it to each bank receit entry node, then add the relationship between the 2 matching nodes [br--matches-->bs] I could possibly add an index in the equation to speed things up, but basically my goal is to find the most efficient ways to doing it. Any pointers would be appreciated, patterns included :) . Kind regards, Stephane ------------------------------------------------------------------------ ------------------------------------------------------------------------
<<inline: example1.png>>
<<inline: example2.png>>
_______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
