Yes, what Clark said, nodes have index free adjacency for both incoming and outgoing relationships. So they are fast to traverse and even substructured per type and direction.
On Sun, Jul 10, 2016 at 10:10 PM, Clark Richey <clark.ric...@gmail.com> wrote: > It doesn't make a difference which way you make the relationship. The > search will be equally fast either way > > Sent from my iPhone > > On Jul 10, 2016, at 15:47, Kevin Krumwiede <kjk...@gmail.com> wrote: > > I'm new to Neo4j and playing around with a simple project before I attempt > anything more ambitious. > > Say I have a simple domain with Games and Players. Starting from a Game, > I may want to get all related Players. Starting from a Player, I may want > to get other Players related the same Game. Considering these queries, and > not knowing yet which one will be more common, does it make any difference > whether I model the domain as (g:Game)-[:HAS_PLAYER]->(p:Player) or > (p:Player)-[:JOINED]->(g:Game)? Can incoming relationships be traversed as > cheaply as outgoing ones? > > -- > 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. > > -- > 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. > -- 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.
