Performance is not good when finding the paths between 2 nodes with k-shortest

Users Dgraph
1

Hi there,
I tried to find paths between 2 nodes, currently only k-shortest path queries could be used, the performance was not good when i queried with numpaths larger than 10.
Is there any suggestion on that ?
Why the performance lose a lot when numpaths become larger?
Why the performance changed with depth 10?
Any way to improve it?

I used the dgraph-ha.yaml to deploy my dgraph
and here’s my ql to query
{
path as shortest(from: 0x107db5, to: 0x138ac1, numpaths:10) {
_Concept
~_Concept
_MainProduct
~_MainProduct
}
path(func: uid(path)) {
Name
StockCode
}
}

here’s the results:
10<=numpaths<=20 : 9.5s to 10s
numpaths<10 : 100 to 300ms

BTW, i used the HDD for this test

Thanks