-
Notifications
You must be signed in to change notification settings - Fork 13
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Paginate task listing #12
Comments
Do you also want a next command? Maintaining the state between requests might not be desirable though. |
Naw, I think it's fine to drop some ops. Best-estimate instead of correctness is critical for this performing well, haha. Traversing backwards in time should be relatively stable anyway. |
So each pagination request is separate with no shared state? Do we want a less than id param if we're traversing backwards? |
Yeah, I'd say less than and greater-than are reasonable. There's probably an extended discussion to happen around the sort-merge equi-join and how much estimation is acceptable. My guess is it's probably ideal to estimate a range based on density then return every result with an ID between a lower and upper ID bound, rather than doing a hard-limit and throwing away a bunch of IDs. |
Task listing should take limit and greater-than some-id constraints.
The text was updated successfully, but these errors were encountered: