Hello,
I need some Query help with a Graph Scheme.
I would like to avoid Gremlin because I want to understand Orient SQL.
And maybe avoid TRAVERSE since it has been mentioned its a more "costly"
query.
I try to explain it clearly.
- The Scheme has 3 Vertex Classes (AV, BV, CV) and 2 Edge Classes (dE, eE)
- (no lightweigt edges)
AV <---dE---> BV <---eE---> CV
Starting point is a Vertex in AV.
Goal is to get all BV, that are linked with one AV and are also linked to
one CV which has property='exampleString'.
AV <---dE---> BV
<---eE---> CV
(Start) (one to many) (Results) (many to one) (if linked to CV
with property='String')
Here is one of my failed attempts (for your entertainment).
SELECT expand( $c ) LET $a = (SELECT expand(set(out('dE'))) FROM AV WHERE
@rid=#14:0), $b = (SELECT expand(set(out('eE'))) FROM CV WHERE
property='exampleString'), $c = (SELECT FROM $a WHERE $a.@rid = $b.@rid)
(this part works)
(this part
works)
(this does not work)
Also i would propose a new Tag "query" or "osql", so you can quickly search
and learn from other questions.
thanks.
--
---
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.
