Your understanding here is correct. In your example: Given a node with 10E7 relationships and you want to know if it is connected to node x. If you know that x has significant lesser relationships you can reverse the traversal direction and check if x is connected to a. This will be cheaper as only the smaller linked list of node x needs to be iterated.
-- 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/groups/opt_out.
