Backend, Data & Security More detail C · Industry convention Platform: Web

Cursor Pagination

Cursor pagination continues after a hidden marker in a fixed sort order. It does not count and skip every earlier record.

See how it works
You might call it keyset paginationcontinuation token

See how it works

Original worked exampleCursor Pagination

Another example

A review queue sorts cases by `created_at DESC, id DESC` and returns an `endCursor` that hides both values. New cases above do not repeat rows already reviewed. If the cursor's record is deleted, the next page still starts at the sort boundary, and changed cursors fail validation.

Main parts

  1. 01Deterministic unique order
  2. 02Opaque continuation cursor
  3. 03Bounded edge page

Use it when

Use it for large or fast-changing sorted data when stable next and previous pages matter more than page numbers.

Do not use it when

Do not hide a changing database offset and call it a cursor. Do not promise jumps to any page without a separate index plan.

Name used in code

opaque cursor over a unique deterministic sort key + first/after or last/before

Before you ship

Check contracts and invariants, authorization, and input limits. Test retries, one-time effects, timeouts, and partial failures. Verify data integrity, compatibility, monitoring, recovery, and rollback.

Request you can copy

Outcome: Design or review Cursor Pagination for this system while keeping data correct, secure, and easy to operate. User context: A review queue sorts cases by `created_at DESC, id DESC` and returns an `endCursor` that hides both values. New cases above do not repeat rows already reviewed. If the cursor's record is deleted, the next page still starts at the sort boundary, and changed cursors fail validation. Technical concept or control: Cursor Pagination. Why it fits: Use it for large or fast-changing sorted data when stable next and previous pages matter more than page numbers. Do not use it when: Do not hide a changing database offset and call it a cursor. Do not promise jumps to any page without a separate index plan. Engineering requirements: Define inputs, outputs, contracts, and rules that must always hold. Set authorization and input checks. Define failures, timeouts, retries, one-time effects, data moves, and compatibility limits. Operations: Add useful signals and logs that hide sensitive data. Set capacity limits and write an operator guide. Test recovery and rollback. Acceptance criteria: Contract and failure-path tests pass. Data and authorization rules still hold during retries and partial failures. Check performance limits, monitoring, recovery, and rollback. Evidence and limits (evidence boundary): No single official standard controls the whole term. Its meaning may change across teams, platforms, or frameworks. Unknowns to confirm: Where the code runs, data stores, traffic shape, consistency needs, and the security boundary. Also confirm the compatibility period, service goals, and rollback limits.

Check this request

Review the current use of Cursor Pagination. Definition: Cursor pagination continues after a hidden marker in a fixed sort order. It does not count and skip every earlier record. Release checks: Check contracts and invariants, authorization, and input limits. Test retries, one-time effects, timeouts, and partial failures. Verify data integrity, compatibility, monitoring, recovery, and rollback. Before changing code, report the evidence you found, gaps, severity, and the smallest safe fix.

C
How official is this term?

Industry convention

People often use this term at work. The listed sources may support practice or limitations. They do not define every part of the term.

No single official standard controls the whole term. Its meaning may change across teams, platforms, or frameworks.

Scope
Cursor-based connection convention
Document status
stable
Checked on
2026-07-30

Evidence sources & scope

Authority source + Term reference · Relay · stable GraphQL Cursor Connections Specification Scope: Relay-compatible cursor connection fields Role here: Direct term reference Source covers: canonical name, definition, semantics, implementation

Copy it yourself

The browser could not copy this. Select the request below and copy it yourself.