The overwhelming likelihood here is that the queries you executed simply didn't need a rel index for best performance. Here's a quick breakdown of why I think so.
.
We first need to consider how Neo4j uses indexes. Unlike RDBMS, which uses indexes e...
Thomas gives a great answer. The only downside to multiple DBs, though, is that you cannot then query both graphs with one transaction unless you implement the Fabric add-on layer.
In your case, it doesn't seem like you care about querying both grap...
The traversal API is very different from Cypher. The primary difference between the two is that Cypher is declarative while the Traversal API is imperative.
For simple queries, Cypher is better. The traversal API is only faster/easier in certain sp...
If I'm understanding the situation properly, the simplest solution would be to assign variables to individual objects instead of the whole path. For example, rather than
MATCH p = (n:Label{property: x})-[r]->(m)
RETURN p
you could do
MATCH (n:Label{...
Cobra's idea is probably the best one from a graph performance perspective.
However, it is possible to make a list-of-lists: use a Map
The main syntactic difference is that a map is wrapped in curly braces instead of brackets. Obviously, there are ...