>
>
> Thank you for your suggestions. The database is about 5.5G on disk.
I turned off auto indexing and applied the constraint on node id, but saw
no discernible difference in response time. Perhaps the culprit is the
pathfinding algorithm?
When I ask for the shortest path between two nodes t
*tldr*
My project involves Wikipedia's pagelinks dataset. When imported into in
Neo4j, this results in a large directed graph with ~11m nodes and ~172m
relationships. I want to efficiently find the shortest path between any two
nodes in the graph. With my current query--and after tweaking wit
