Hi, nice question. I guess this function regards only lightweight edges, since they are represented as collections of RIDs. For non-lightweight edges this is another story.
As far as I know this function is not implemented, but it should be possible. In documentation it is said that edges are implemented as sets, but which are the attributes used to consider two edges equals? Can they be customized? This could be a nice feature to implement constraints on edges, for example: - equals is by RID: there can't be two edges between the same nodes (with the same label) - equals by a property (e.g. timestamp): there can't be two edges between the same nodes (with the same label) AND with the same timestamp Regarding non-lightweight edges they are records, so you can create indexes on them and using ORDER BY in your queries to order them at query time. Cheers, Riccardo 2015-01-15 19:58 GMT+01:00 Darius Felski <[email protected]>: > Hi! > > I'm looking for additional information about that topic: > > > http://www.orientechnologies.com/docs/last/orientdb.wiki/Graph-Database-Tinkerpop.html#ordered-edges > > I there a way to control the order by using a property on the edge or > implement a custom comparator? > > > Best regards, > > Darius > > -- > > --- > 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. > -- --- 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.
