Hello everyone, I'm started to work on Orientdb recently and it now it has been a pleasure. Nice to see hardworking people developing a good product.
I posted this question on the Gremlin-users mailing list (Edge sorted query <https://groups.google.com/forum/#!topic/gremlin-users/xLpaMoMh23s>) and found out that for Orient 1.7.10 there is no efficient way to get a set of vertices ordered by a property on an edge (see below, the problem is better explained) using tinkerpop, since the version supported is 2.0. Hence, I would like to know if there is a way to do this using the native API of Orientdb (when Orient upgrades to TP 3.0 probably I will switch as well since it appears there is a great improvement from TP2 to TP3). The problem is depending on this structure: Vertex A1 -> Vertex B Vertex A2 -> Vertex B Vertex A3 -> Vertex B . . . Vertex AN -> Vertex B where each edge from Ai to B has a property "prop" and contains different values. Starting from Vertex B, I'm trying to find the vertexes Ai where the edge "prop" is highest and, lets say, limit the search to the top 100 vertexes. Thanks and kind regards, Manuel Coutinho -- --- 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.
