2 ms·

All the graph database traversals I've seen are fairly simple (Friend of a friend, Movies starring X). Are they a good choice for turn-by-turn navigation, and

by pbowyer 11y ago

All the graph database traversals I've seen are fairly simple (Friend of a friend, Movies starring X). Are they a good choice for turn-by-turn navigation, and answering questions (given a traffic dataset) like: "What has been the quickest route between A and P, departing at 8am on a Monday morning?"

mrjn 11y ago
We've examples of some pretty deep Graph queries (8 levels), for e.g. the last query here: https://github.com/dgraph-io/dgraph/wiki/Test-Queries https://github.com/dgraph-io/dgraph/wiki/Test-Queries Finding the shortest route between A and B is on the roadmap. This would mean adding a weight to the edge. Navigation adds yet another interesting factor, which means we need to store multiple weights per edge, depending upon time of the day, day of the week, or day of the year etc. This would be an interesting challenge to solve; probably by v1.0.