cursor pagination

Paging by remembering the position of the last item seen and asking for items after it, such as ?after=2&limit=2.

In more detail

Because it continues from a position in a stable order rather than a count, inserts and deletes do not shift later pages. The order must end with a unique tie breaker, and the cursor must remember the full sort position. An opaque cursor lets the server change how it encodes that position.

Related terms

Taught in

References