Hi, As far as I know there is no way to do that without: - Scanning all the "incoming classes" edges - Fetch the edges + vertexes - Keep them all in memory while they are being sorted - Return the top n edges/vertexes
This happens behind the scenes and is not problematic on the query side but it is on the performance side. This is one of the issues we have come across when working with dense graphs and the changes, needed to fix this, are on the backlog. I would love fore someone to tell me that I'm terribly wrong here. Regards, -Stefan On Monday, 18 May 2015 14:58:17 UTC, Andrey Verbin wrote: > > Hi there! > > Let say I'm building something like Twitter. There is a User with 20000 > followers modeled as a relationships between User and Follow classes. Every > user reference N Follow instances which in turn has a link to follower user > and also creation date. I want to display paginated list of followers but > not sure how to do it with OrientDB. What would be the best way to display > paginated list of such followers sorted by creation date? > > 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.
