Question

We have a use case where we need to to use graph db.There are around

10000 nodes and 1000000 edges (approx).

Now i need to query like this. For any 2 vertex find all possible paths between them.

How much time origntDb will take for it?I want retrival time to be very minimal.Is this supported by orientDB?

The distance of two vertex will be around 20.But each vertex may have around 10 outgoing edges.

Answer 1

For all paths between vertex 1 and 2 in Gremlin, do:

g.v(1).out.loop(1){true}{it.object.id==2}.path

Of course, all possible paths are infinite if you have cycles, so you will probably want to do this:

g.v(1).out.loop(1){true}{it.object.id==2}.path[0..100]

…to get at most 100 paths. You can also do this to remove cyclic paths:

g.v(1).out.simplePath.loop(2){true}{it.object.id==2}.path[0..100]

Marko.