(no title)
feike | 3 years ago
His site is a great resource for anyone wanting to take a deeper dive on SQL performance:
https://use-the-index-luke.com/sql/partial-results/fetch-nex...
feike | 3 years ago
His site is a great resource for anyone wanting to take a deeper dive on SQL performance:
https://use-the-index-luke.com/sql/partial-results/fetch-nex...
ReactiveJelly|3 years ago
https://old.reddit.com/?count=25&after=t3_wtpvdp
I noticed Reddit's pagination has that "after" parameter, which points to the last post on the current page.
It glitches out if the last item is deleted by moderators, but otherwise it works smoothly.
djbusby|3 years ago
MatmaRex|3 years ago
https://en.wikipedia.org/w/index.php?title=Category:Living_p...
wootest|3 years ago
pvorb|3 years ago
croes|3 years ago
No need for row value syntax and it works with MS SQL Server
dinkledunk|3 years ago
nextaccountic|3 years ago
> As we saw, plain keyset pagination offers no facility to jump a certain percentage into the results except through client guesswork. However the PostgreSQL statistics collector maintains per-column histograms of value distribution. We can use these estimates in conjunction with limits and small offsets to get fast random-access pagination through a hybrid approach.
squeaky-clean|3 years ago
Unless you can guarantee your data is static, or that the sorting order cannot be mutated and only append later values, the concept of what data belongs in which page could be changing every millisecond.
jsmith99|3 years ago
MatmaRex|3 years ago
hnuser847|3 years ago