Thank you my friend. YES, finally I have a query that solves my problem.
It to 8 seconds for the first call then 1.78 seconds the 2nd time. But Intersect() is essentially a join, right? ;) I was hoping that it would be possible to follow the graph around until I found what I wanted but maybe this is more efficient. In my 10+M rows one word appears only 6 times and then the other appeared 382 times so it would have been nice if I could look at the out edges the 6 books that matched the first word then see if the 2nd word is in that list. I guess that's what an intersection is but it just feels less graph-like. THANK YOU AGAIN -- figuring this out was killing me! -- --- 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.
