Re: hasNext() slow for large number of incoming edges

Matthew Nguyen <nguyenm9@...>

Hi Boxuan,

Happy to put in a request on github but still a little confused. Are we saying g.E().has('index_key', 'large_number_of_edges').hasNext() isn't streaming but should (note: g.E().hasNext() is fast) ?  Also, I think to close the gap on RDF/Property Graph, we do need to see what can be done about allowing for natural modeling in RDF which is really to make liberal use of edges. The problem with properties and RDF is that RDF expects you to index virtually everything in order for the queries to be quick.  Not sure how we can model non-generic properties in that capacity.

BTW I'm using Joshua's Graphsail ( implementation to see if I can get it to work and trying to work through some of the edge (no pun intended) cases.

thx, matt

Join { to automatically receive all group messages.