Hi, I've asked a question on slack, which has not been resolved yet: https://stackoverflow.com/questions/51585565/efficient-path-traversal-using-aql-on-a-large-bipartite-graph-in-arangodb
But the response has prompted me to ask some questions here about ArangoDB's graph current and future capabilities. I'm currently doing a side-by-side evaluation of Neptune and ArangoDB. I like ArangoDB for many reasons, but I'm interested in doing some complex traversals on a very large graph. My impression is that the Gremlin language (used by Neptune) handles traversals with pruning, but so far I have not been able to get any useful pruning happening in the traversals. Is this something that is coming soon? The stack-overflow response directed me to this: https://github.com/arangodb/arangodb/issues/3979 Should I just add my comments here? Cheers, Brett -- You received this message because you are subscribed to the Google Groups "ArangoDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
