HN user
Interesting article. What kind of graph algorithms can be implemented in this Pregel framework and how compares the complexity of this approach to specialised algorithms not using the framework? Nay hints or references would be appreciated.
I like that ArangoDB can be extended by micro services. Does this not raise security concerns, because user code is executed on the DB server?
Thanks for both your answers, this is really interesting indeed. I always thought that joins are a "no, no, no" in the NoSQL world. This opens up a whole lot of new possibilities. I will have to have a look at this ArangoDB thing...
Can you give an example for a join between two different sharded document collections that can be executed efficiently on say 100 servers?