You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
Uh oh!
There was an error while loading. Please reload this page.
-
I’ve been experimenting with a small library for efficient cursor-based pagination in Slick (Play 3.x + Scala 3.x).
Instead of offset/limit, it uses a seek method with timestamp + ID ordering to page through large datasets without performance degradation.
Repo: https://github.com/hanishi/play-scala-slick-partial-results
The current version is focused on timestamp ordering, but the idea could be generalized to any comparable key, I think but I am not sure.
I’d love feedback from others.
Does the approach feel idiomatic enough for Slick?
Would a more general KeyColumn[K] abstraction (not just timestamp) be useful?
Any gotchas you’ve hit with cursor/seek pagination in real systems?
Beta Was this translation helpful? Give feedback.
All reactions