Depth traversal Orientdb

Question

How can I get depth traversal of a graph in Orientdb . Using the documentation here is what I tried , yet when I run in I get an error here is the query .

EXPLAIN SELECT FROM (TRAVERSE any("Edge1") FROM P_H WHILE $depth <= 3) WHERE p ='SP00000000001';

The goal is the get the equivalent of this Neo4j Query :

MATCH (n:Node{NodeID:"SP00000000001"})-[:Edge1*1..3]-(d) RETURN Distinct d, n

Any help would be appreciated

Luigi Dell'Aquila · Answer 1 · 2017-07-14T12:28:44.283

1

The easiest thing is using a MATCH statement: http://orientdb.com/docs/2.2.x/SQL-Match.html

 MATCH
   {class:Node, as:n, where:(NodeID = "SP00000000001") -EdgeClass- {as:d, while:($depth < 3), where: ($matched.n != $currentMatch)} }
 RETURN d, n

Or RETURN $elements if you want the vertices expanded

edited Jul 14 '17 at 12:28

answered Jul 13 '17 at 16:02

Luigi Dell'Aquila

2,804
10
13

but it is so slow ? is that a normal behaviour? – Muna arr Jul 14 '17 at 08:28
How many edges does the left node have? I just updated the answer with an additional condition that should speed up the query – Luigi Dell'Aquila Jul 14 '17 at 12:29
Why is orientdb showing slow behaviour for depth 3 ? – Muna arr Aug 23 '17 at 10:00
The speed depends mainly on how many vertices/edges you are traversing. If your graph has a span of 1000, depth 3 means traversing 1billion edges – Luigi Dell'Aquila Aug 24 '17 at 06:02
In test performances we observe that OrientDB is faster than neo4j , yet I'm getting the opposite result, neo4j is presented to be faster , is that normal – Muna arr Aug 24 '17 at 10:39

Depth traversal Orientdb

1 Answers1