Increasing vertices returned by subqueries, the intersect increase the computation time .. How much slower honestly do not know, the only way to understand it is to do some testing . I believe that intersect instruction compare simply RID of the vertices returned by subqueries (certainly less than the total number of vertex) so it is faster than scroll million vertices.
Indexes are already present on the fields used by subqueries .. regards Savio L. -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
