Which pagination choice avoids high OFFSET cost at large page numbers?

Problem Statement

Explanation

Seek uses a “where key > lastKey” predicate. The index can resume quickly without scanning skipped rows. It is stable and efficient but requires a deterministic order and a resume token.

Code Solution

SolutionRead Only

SELECT * FROM posts WHERE id < :cursor ORDER BY id DESC LIMIT 20;

Practice Sets

This question appears in the following practice sets:

Low-Level Design (LLD) Interview Core

Next Question

Master Interviews
Anywhere, Anytime

Which pagination choice avoids high OFFSET cost at large page numbers?

Problem Statement

Explanation

Code Solution

Practice Sets

Related Questions

Which statement best describes the Single Responsibility Principle?

Open–Closed Principle encourages what practice when adding features?

High-Level Design (HLD) typically focuses on which artifacts?

Which UML diagram best captures interactions over time between components?

Which pairing describes a healthy design goal?

More from System Design

Master Interviews Anywhere, Anytime

Which pagination choice avoids high OFFSET cost at large page numbers?

Problem Statement

Explanation

Code Solution

Practice Sets

Related Questions

Which statement best describes the Single Responsibility Principle?

Open–Closed Principle encourages what practice when adding features?

High-Level Design (HLD) typically focuses on which artifacts?

Which UML diagram best captures interactions over time between components?

Which pairing describes a healthy design goal?

More from System Design

Master Interviews
Anywhere, Anytime