Hi, I have the following datastructure (every entity has its own class): vertexes : vA, vB, vC, vD, vE there is eAB between vA and vB with one to many relation eBC between vB and vC with one to many relation eDC between vD and vC with one to many relation from D to C (so vC is a for resolving many to many between vB and vD, but having lots of properties) eED between vE and vD with one to many relation from E to D
Now I would like to find vA and vD nodes where there is a path between with the following conditions and expectations: - I need the ID and some fields from both vA and vD - want to know the number of path between vA and vD - want to sum() some fields in vC as weight - want to filter on fields of all vertexes (vA.fld='X', vB.fld_b = 'Y', etc Basically the situation is something like: [person] - (having)->[user accounts] [user account]-(post)->[message]-(to)->[recepients' account] [recepient's account]-(belongs to)->[user] So want to know who sent messages in certain time to X type of user and how many times. Wants to know the first and last date. The sender belongs to Y domain. person.domain = 'Y' message.sent_date between D1 and D2 user.type = 'hacker' I need it in SQL. Any suggestion is very appreciated! Thank you in advance! L. -- --- 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.
