Keyset pagination for performance in Rest API - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to add a keyset pagination parameter to the API endpoint.

Rest API

GET /items?[1]=100

Drag options to blanks, or click blank then click option'

Aoffset

Bpage

Clast_id

Dlimit

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'page' or 'offset' which are for offset pagination, not keyset pagination.

Keyset pagination uses a cursor like last_id to fetch the next set of results efficiently.

2fill in blank

medium

Complete the SQL WHERE clause to implement keyset pagination using the last seen ID.

Rest API

SELECT * FROM items WHERE id [1] ? ORDER BY id ASC LIMIT 10

Drag options to blanks, or click blank then click option'

A>

B<=

C=

D<

Attempts:

3 left

💡 Hint

Common Mistakes

Using '<' which would fetch previous items instead of next.

To get the next page, select rows with IDs greater than the last seen ID.

3fill in blank

hard

Fix the error in the API query parameter for keyset pagination.

Rest API

GET /items?[1]=abc123

Drag options to blanks, or click blank then click option'

Aoffset

Blast_id

Cpage

Dlimit

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'page' or 'offset' which are for offset pagination.

The keyset pagination cursor should be named last_id to indicate the last item fetched.

4fill in blank

hard

Fill both blanks to complete the SQL query for keyset pagination with a timestamp cursor.

Rest API

SELECT * FROM events WHERE event_time [1] ? ORDER BY event_time [2] LIMIT 20

Drag options to blanks, or click blank then click option'

A>

B<

CASC

DDESC

Attempts:

3 left

💡 Hint

Common Mistakes

Using '<' and DESC which would fetch older events in reverse order.

To get newer events, select where event_time is greater than the cursor and order ascending.

5fill in blank

hard

Fill all three blanks to complete the Python function that builds a keyset pagination query.

Rest API

def get_items_query(last_id):
    query = "SELECT * FROM items WHERE id [1] [2] ORDER BY id [3] LIMIT 10"
    return query

Drag options to blanks, or click blank then click option'

A>

B?

CASC

DDESC

Attempts:

3 left

💡 Hint

Common Mistakes

Using '<' or 'DESC' which would reverse the pagination order.

Forgetting to use a parameter placeholder.

The query uses '>' to get items after last_id, uses a placeholder '?' for parameter, and orders ascending.

Practice

1. What is the main advantage of using keyset pagination over traditional offset-based pagination in REST APIs?

easy

A. It requires less server memory by caching all pages in advance.

B. It allows jumping to any page number directly without sequential access.

C. It improves performance by avoiding slow offset queries on large datasets.

D. It automatically sorts data in descending order without extra code.

Solution

1. Step 1: Understand offset-based pagination issues

   Offset pagination uses a page number and offset, which becomes slow on large datasets because the database must skip many rows.

2. Step 2: Recognize keyset pagination benefits

   Keyset pagination uses a fixed key (like an ID) to fetch the next set of rows, avoiding the costly skip operation and improving performance.

3. Final Answer:

   It improves performance by avoiding slow offset queries on large datasets. -> Option C

4. Quick Check:

   Keyset pagination = better performance [OK]

Hint: Keyset uses keys, not offsets, for faster queries [OK]

Common Mistakes:

• Thinking keyset allows random page jumps
• Assuming keyset caches all data
• Believing keyset changes sort order automatically

2. Which of the following is the correct SQL snippet to implement keyset pagination for a table users ordered by id?

easy

A. SELECT * FROM users ORDER BY id LIMIT 10 OFFSET 20;

B. SELECT * FROM users WHERE id > 20 ORDER BY id LIMIT 10;

C. SELECT * FROM users WHERE id = 20 ORDER BY id LIMIT 10;

D. SELECT * FROM users ORDER BY id DESC LIMIT 10 OFFSET 20;

Solution

1. Step 1: Identify keyset pagination syntax

   Keyset pagination uses a WHERE clause with a key (like id > last_seen_id) and a LIMIT to fetch the next page.

2. Step 2: Analyze each option

   SELECT * FROM users WHERE id > 20 ORDER BY id LIMIT 10; uses WHERE id > 20 with ORDER BY id LIMIT 10, which matches keyset pagination logic.

3. Final Answer:

   SELECT * FROM users WHERE id > 20 ORDER BY id LIMIT 10; -> Option B

4. Quick Check:

   Keyset uses WHERE key > last_key [OK]

Hint: Keyset uses WHERE with key comparison, not OFFSET [OK]

Common Mistakes:

• Using OFFSET instead of WHERE for pagination
• Using equality (=) instead of greater than (>)
• Not ordering results by the key column

3. Given this REST API endpoint using keyset pagination:

GET /items?last_id=50&limit=5

And the database table items with IDs: [45, 47, 50, 52, 55, 60, 65], what will be the IDs returned by this request?

medium

A. [52, 55, 60, 65]

B. [45, 47, 50, 52, 55]

C. [52, 55, 60, 65, 70]

D. [51, 52, 53, 54, 55]

Solution

1. Step 1: Understand keyset pagination with last_id=50

   The API returns items with IDs greater than 50, limited to 5 results.

2. Step 2: Select IDs greater than 50 from the list

   IDs greater than 50 are [52, 55, 60, 65]. There are only 4 such items, so all are returned.

3. Final Answer:

   [52, 55, 60, 65] -> Option A

4. Quick Check:

   IDs > 50 limited to 5 = [52, 55, 60, 65] [OK]

Hint: Return items with ID > last_id, up to limit [OK]

Common Mistakes:

• Including items with ID equal to last_id
• Using offset instead of key comparison
• Assuming IDs are continuous numbers

4. You have this SQL query for keyset pagination:

SELECT * FROM orders WHERE order_date > '2024-01-01' ORDER BY order_date LIMIT 10;

But it returns duplicate rows when new orders are added. What is the likely cause?

medium

A. Ordering by a non-unique column causing duplicates

B. LIMIT value is too high causing repeats

C. Missing OFFSET clause to skip duplicates

D. Using > instead of >= in WHERE clause

Solution

1. Step 1: Identify ordering column uniqueness

   Ordering by order_date alone can cause duplicates if multiple rows share the same date.

2. Step 2: Understand keyset pagination requirements

   Keyset pagination requires ordering by a unique column or combination to avoid duplicates and missing rows.

3. Final Answer:

   Ordering by a non-unique column causing duplicates -> Option A

4. Quick Check:

   Order by unique key to avoid duplicates [OK]

Hint: Order by unique keys to prevent duplicates [OK]

Common Mistakes:

• Thinking OFFSET fixes duplicates
• Using >= instead of > causes duplicates
• Assuming LIMIT controls duplicates

5. You want to implement keyset pagination on a REST API that returns products sorted by price ascending, then by id ascending to break ties.
Which SQL WHERE clause correctly fetches the next page after last product with price=100 and id=50?

hard

A. WHERE price > 100 OR id > 50

B. WHERE price >= 100 AND id > 50

C. WHERE price > 100 AND id > 50

D. WHERE price > 100 OR (price = 100 AND id > 50)

Solution

1. Step 1: Understand multi-column keyset pagination

   When ordering by multiple columns, the WHERE clause must handle the first column and then the second to break ties.

2. Step 2: Analyze the correct condition

   The correct condition is price > 100 OR (price = 100 AND id > 50) to get all rows with higher price or same price but higher id.

3. Final Answer:

   WHERE price > 100 OR (price = 100 AND id > 50) -> Option D

4. Quick Check:

   Multi-column keyset uses OR + AND for tie-break [OK]

Hint: Use OR with AND to handle multi-column keys [OK]

Common Mistakes:

• Using AND instead of OR for first column
• Ignoring tie-break column in WHERE clause
• Using >= instead of > causing duplicates