It’s pretty short, it could be improved with benchmarks or at least some examples of how that would be implemented efficiently. Maybe a bit of pros and cons, cursor pagination for example doesn’t handle “go directly to page 200” very well. I’ve also seen some interesting hacks to make offset pagination surprisingly fast with a clever subquery.
I mean, for what it’s worth, you calling it “pretty short” is what made me go read the article, because quite frankly, my attention span isn’t long enough to read through an average-length article for a topic like this.
Ah, thanks for linking that PR. The point made in the article is a good and helpful one, as can be seen by the way so many sites get it wrong, including Lemmy in the past. It’s just that it is pretty thin to make a whole article around. It would be a good thing to bring up in an optimization guide that covers more topics.
I would be interested to know if there is substantial cost to keeping cursors open for long periods, while the db is being updated. I think given those labels, it may be preferable to do a new select each time the user requests the next page. But I haven’t benchmarked that.
If you look at how Wikipedia pages through article histories, the labels are timestamps with 1 second resolution.
Here is another article about the same topic, part of the author’s book on SQL performance:
Fairly lame article but yeah this is something lemmy used to get wrong. I haven’t paid attention to whether it still does.
They fixed this in version 0.19 pr #3872 (note that the cursor here is a way of hiding a post ID to continue from, as far as I can see).
Also, lame article? 😖
Not lame, I appreciated it and as a result will be implementing ID-based pagination, sometime.
Thank you! It’s lovely to hear it was helpful to someone 😊
It’s pretty short, it could be improved with benchmarks or at least some examples of how that would be implemented efficiently. Maybe a bit of pros and cons, cursor pagination for example doesn’t handle “go directly to page 200” very well. I’ve also seen some interesting hacks to make offset pagination surprisingly fast with a clever subquery.
I wouldn’t call it lame though.
I mean, for what it’s worth, you calling it “pretty short” is what made me go read the article, because quite frankly, my attention span isn’t long enough to read through an average-length article for a topic like this.
Now we’re judging articles for quantity instead of quality?
Ah, thanks for linking that PR. The point made in the article is a good and helpful one, as can be seen by the way so many sites get it wrong, including Lemmy in the past. It’s just that it is pretty thin to make a whole article around. It would be a good thing to bring up in an optimization guide that covers more topics.
I would be interested to know if there is substantial cost to keeping cursors open for long periods, while the db is being updated. I think given those labels, it may be preferable to do a new select each time the user requests the next page. But I haven’t benchmarked that.
If you look at how Wikipedia pages through article histories, the labels are timestamps with 1 second resolution.
Here is another article about the same topic, part of the author’s book on SQL performance:
https://use-the-index-luke.com/sql/partial-results/fetch-next-page
Who uses “lame” in 2024? It was so pervasive during the Digg times.