Why pagination manages large datasets in Rest API - Performance Analysis

Time Complexity: Why pagination manages large datasets

O(k)

Understanding Time Complexity

When working with large datasets in APIs, it is important to understand how the time to get data grows as the dataset grows.

We want to see how pagination helps control this growth.

Scenario Under Consideration

Analyze the time complexity of the following API endpoint using pagination.

GET /items?page=2&limit=10

// Server code example:
function getItems(page, limit) {
  const start = (page - 1) * limit;
  const end = start + limit;
  return database.items.slice(start, end);
}

This code returns a small page of items from a large dataset by slicing only the needed part.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Extracting a slice of items from the dataset.
• How many times: Only the number of items requested per page (limit), not the whole dataset.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
10	10 items processed
1000	10 items processed
1000000	10 items processed

Pattern observation: No matter how big the dataset grows, the number of items processed per request stays the same because of pagination.

Final Time Complexity

Time Complexity: O(k)

This means the time to get data depends only on the page size (k), not the total dataset size.

Common Mistake

[X] Wrong: "Getting page 10 means processing all items from page 1 to 9 first."

[OK] Correct: Pagination lets the server jump directly to the requested page slice without processing earlier pages.

Interview Connect

Understanding how pagination controls data fetching time shows you can handle large data efficiently, a key skill in real-world API design.

Self-Check

"What if we changed the page size dynamically based on user input? How would the time complexity change?"