We have a use case like this : 10M nodes and 30M edges (approx).
I need to query like this. For any 2 vertexes find all 2 or 3 or 4 degrees possible paths between them. 2 degree separation like V - E - V - E - V
What is the fastest solution supported by orientDB? How to do that in OrientDB queries?
--
---
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 orient-databa...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
--
---
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 orient-databa...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.