Hacker News new | ask | show | jobs
by alexchamberlain 1998 days 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.
1 comments

This is the best one I've been able to come up with: https://engineering.medallia.com/blog/posts/sorting-and-pagi...