Re: hasNext() slow for large number of incoming edges
Boxuan Li
Hi Matthew, Unfortunately, that is not possible. You could do g.V(v).inE(e).range(from, to).hasNext() to “page” the result by yourself, but under the hood, it will fetch all the first “to” results and drop the first “from” results. Btw, 7 million incident edges sound too many to me. This could cause various problems, e.g. high memory usage, large partition (depending on your storage). You might consider remodelling it. Best, Boxuan
On Wed, Jan 26, 2022 at 3:11 AM Matthew Nguyen via lists.lfaidata.foundation <nguyenm9=aol.com@...> wrote:
|
|