3 ms·
I can't find one right now, but I feel like there must be an algorithm that can identify the key that can be used for each page, yet cheaper than a full sort (i
by alexchamberlain 6y ago
I can't find one right now, but I feel like there must be an algorithm that can identify the key that can be used for each page, yet cheaper than a full sort (ie cheaper than offset pagination in generality). Of course, a skip list would work for a secondary index.
- juancn 6y agoThis is the best one I've been able to come up with: https://engineering.medallia.com/blog/posts/sorting-and-paging-on-distributed-data/ https://engineering.medallia.com/blog/posts/sorting-and-pagi...