shekarm commented :
We don’t have those kinds of algorithms natively in Dgraph with the sole exception of shortest paths.
You could still do it but you’d have to implement those algorithms as client code, which would probably be slower than a database that has this type of algorithms available natively.
— original message —
On January 13, 2020, 6:25 AM PST notifications@github.com wrote:
Hi, Dgraph,
Recently, I am doing some experiments based on ldbc_snb benchmark. And I wan to test Dgraph on ldbc. And some users also want to do so. But I found graphQL± has some limitations to implement the complex queries in ldbc_snb. So I want to know if you have implemented ldbc_snb benchmark for Dgraph? Could you please provide me a solution to run ldbc_snb benchmark on Dgraph?
Thanks for your kindly support and I’m looking forward to your early reply!
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub, or unsubscribe.
— end of original message —