I've been reading about Neo4j's internals and found it interesting that a node's relationships are stored as a doubly linked list of relationships. This seems to be ideal for traversing a graph with relatively few relationships per node. It does not seem ideal for traversing when a single node can have a large number of relationships. An example use case would be node "A" with 1 million relationships. If I want to determine whether a relationship exists between node "A" and another node "X", Neo4j will have to step through the entire linked list of relationships until it finds the corresponding relationship. This would result in linearly decreasing performance as the number of relationships per node increases. Am I understanding this correctly?
Is there any type of index that can be created to speed up this type of access pattern? -- This message contains confidential information and is intended only for the individual named. If you are not the named addressee you should not disseminate, distribute or copy this e-mail. Please notify the sender immediately by e-mail if you have received this e-mail by mistake and delete this e-mail from your system. If you are not the intended recipient you are notified that disclosing, copying, distributing or taking any action in reliance on the contents of this information is strictly prohibited. -- 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.
