Hello Luigi, I am working with the local DB (plocal). I am using the orientdb-community-2.0-SNAPSHOT version.
The reason I am not using the SQL statement is because it only returns unique nodes in the graph. I need a fully inflated graph with as many duplicate nodes at different levels as there needs to be. Thanks for help Emin On Wednesday, September 16, 2015 at 4:03:10 AM UTC-4, Luigi Dell'Aquila wrote: > > Hi Emin, > > are you working in remote or plocal? > Have you tried with an SQL statement? > > Luigi > > 2015-09-15 23:51 GMT+02:00 Emin Agassi <[email protected] <javascript:> > >: > >> >> Hello, >> >> I am trying to traverse a graph using the DFS (depth-first method) and >> using the following API: >> >> Iterable<Edge> edges = >> vertext.query().direction(Direction.OUT).labels("x1", "x2", "x2", >> "x3").edges(); >> >> It takes over 20 seconds to traverse the graph containing 156,434 nodes >> >> I am not sure why is it so slow. >> >> Thanks >> Emin >> >> >> -- >> >> --- >> 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] <javascript:>. >> For more options, visit https://groups.google.com/d/optout. >> > > -- --- 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.
