Priority queue pattern in Redis - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a priority queue pattern in Redis?

A priority queue pattern in Redis is a way to manage tasks or items where each has a priority. Items with higher priority are processed before lower priority ones, often implemented using sorted sets.

beginner

Which Redis data structure is commonly used to implement a priority queue?

Redis sorted sets (ZSET) are commonly used because they store members with scores, allowing easy retrieval of items by priority.

beginner

How do you add an item with a priority to a Redis priority queue?

Use the ZADD command with the priority as the score and the item as the member, for example: ZADD queue 10 "task1" adds 'task1' with priority 10.

intermediate

How can you retrieve and remove the highest priority item from a Redis priority queue?

Use ZRANGE or ZPOPMIN commands. ZPOPMIN queue 1 returns and removes the item with the lowest score (highest priority if lower score means higher priority).

intermediate

Why might you choose Redis sorted sets over lists for a priority queue?

Sorted sets allow you to assign and query by priority scores efficiently, while lists only support FIFO or LIFO order without priority.

Which Redis command adds an item with a priority score to a sorted set?

A LPUSH

B ZADD

C SADD

D HSET

ZADD adds members with scores to a sorted set, perfect for priority queues.

What does the ZPOPMIN command do in Redis?

A Removes and returns the member with the lowest score

B Adds a member with a score

C Returns all members without removing

D Removes a member by name

ZPOPMIN removes and returns the member with the lowest score, useful for priority queues.

In a Redis priority queue using sorted sets, what does the score represent?

A The length of the item

B The timestamp of insertion

C The priority of the item

D The number of times accessed

The score in a sorted set represents the priority for ordering.

Which Redis data structure is NOT suitable for implementing a priority queue?

A Hashes

B Lists

C Sorted sets

D Sets

Hashes store key-value pairs without order, so they are not suitable for priority queues.

If you want to process the highest priority task first, which Redis command should you use?

A LPOP

B ZRANGE with start=0 end=0

C ZREVRANGE with start=0 end=0

D ZPOPMIN

ZPOPMIN removes and returns the member with the lowest score, which is the highest priority if lower score means higher priority.

Explain how to implement a priority queue in Redis using sorted sets.

Think about how scores represent priority and how to get the top priority item.

What are the advantages of using Redis sorted sets for priority queues compared to lists?

Consider how ordering and retrieval differ between data structures.

Practice

1. What does a priority queue in Redis typically use to manage item importance?

easy

A. Lists with push and pop operations

B. Hashes with key-value pairs

C. Sorted sets with scores representing priority

D. Strings storing serialized data

Solution

1. Step 1: Understand Redis data structures

   Redis offers several data types; sorted sets allow ordering by score.

2. Step 2: Identify priority queue implementation

   Priority queues use sorted sets where scores represent priority levels.

3. Final Answer:

   Sorted sets with scores representing priority -> Option C

4. Quick Check:

   Priority queue = sorted sets with scores [OK]

Hint: Remember: sorted sets sort by score for priority [OK]

Common Mistakes:

• Confusing lists with priority queues
• Using hashes which don't order by score
• Thinking strings can manage priority

2. Which Redis command adds an item with a priority score to a priority queue?

easy

A. HSET

B. ZADD

C. LPUSH

D. SET

Solution

1. Step 1: Identify command to add to sorted sets

   ZADD adds members with scores to sorted sets in Redis.

2. Step 2: Match command to priority queue addition

   Priority queues use sorted sets, so ZADD is the correct command.

3. Final Answer:

   ZADD -> Option B

4. Quick Check:

   Add to priority queue = ZADD [OK]

Hint: Use ZADD to add with score in sorted sets [OK]

Common Mistakes:

• Using LPUSH which is for lists
• Using HSET which is for hashes
• Using SET which is for strings

3. Given the commands:

ZADD tasks 1 "task1" 3 "task3" 2 "task2"
ZPOPMIN tasks

What will be the output of ZPOPMIN tasks?

medium

A. ["task1", "1"]

B. ["task3", "3"]

C. ["task2", "2"]

D. Syntax error

Solution

1. Step 1: Understand ZADD insertion

   Three tasks added with scores 1, 3, and 2 respectively.

2. Step 2: Understand ZPOPMIN behavior

   ZPOPMIN removes and returns the member with the lowest score, which is "task1" with score 1.

3. Final Answer:

   ["task1", "1"] -> Option A

4. Quick Check:

   Lowest score item popped = task1 [OK]

Hint: ZPOPMIN returns lowest score member first [OK]

Common Mistakes:

• Picking highest score instead of lowest
• Confusing ZPOPMIN with ZPOPMAX
• Expecting syntax error from valid commands

4. What is wrong with this Redis command sequence for a priority queue?

ZADD queue "task1" 1
ZPOPMIN queue

medium

A. ZADD requires at least two members

B. ZPOPMIN does not remove items

C. Queue key must be a list, not a sorted set

D. ZADD syntax is incorrect; score must come before member

Solution

1. Step 1: Check ZADD command syntax

   ZADD syntax requires the score before the member, but here member is before score.

2. Step 2: Verify ZPOPMIN behavior

   ZPOPMIN removes the lowest score member correctly; no issue here.

3. Final Answer:

   ZADD syntax is incorrect; score must come before member -> Option D

4. Quick Check:

   ZADD syntax = score before member [OK]

Hint: Score always before member in ZADD [OK]

Common Mistakes:

• Swapping score and member in ZADD
• Thinking ZPOPMIN doesn't remove items
• Using wrong data type for priority queue

5. You want to implement a priority queue in Redis where lower scores mean higher priority. You add tasks:

ZADD jobs 5 "job5" 1 "job1" 3 "job3"

Then you run:

ZPOPMIN jobs 2

What will be the result and what remains in the queue?

hard

A. Returns ["job1", "1", "job3", "3"]; queue left with ["job5"]

B. Returns ["job5", "3", "job3", "1"]; queue left with ["job1"]

C. Returns ["job1", "5", "job3", "3"]; queue left with ["job5"]

D. Returns error because ZPOPMIN cannot pop multiple items

Solution

1. Step 1: Understand ZPOPMIN with count

   ZPOPMIN with argument 2 pops two lowest score members.

2. Step 2: Identify lowest scores and remaining items

   Lowest scores are 1 (job1) and 3 (job3), so these are popped; job5 with score 5 remains.

3. Final Answer:

   Returns ["job1", "1", "job3", "3"]; queue left with ["job5"] -> Option A

4. Quick Check:

   ZPOPMIN 2 pops two lowest score items [OK]

Hint: ZPOPMIN count pops that many lowest score items [OK]

Common Mistakes:

• Mixing up scores and members order
• Thinking ZPOPMIN pops highest scores
• Assuming ZPOPMIN can't pop multiple items