Priority queue pattern in Redis - Time & Space Complexity

Time Complexity: Priority queue pattern

O(log n)

Understanding Time Complexity

We want to understand how fast Redis handles priority queues as the number of items grows.

Specifically, how the time to add or remove items changes when the queue gets bigger.

Scenario Under Consideration

Analyze the time complexity of the following Redis commands for a priority queue.

ZADD tasks 10 "task1"
ZADD tasks 20 "task2"
ZADD tasks 15 "task3"

ZPOPMIN tasks
ZRANGE tasks 0 0 WITHSCORES
    

This code adds tasks with priorities, then removes or reads the highest priority task.

Identify Repeating Operations

Look at what repeats when we add or remove tasks.

• Primary operation: Adding or removing items in a sorted set (ZADD, ZPOPMIN).
• How many times: Each operation works on one item at a time, but the sorted set grows with more items.

How Execution Grows With Input

As the number of tasks (n) grows, adding or removing one task takes more work because Redis keeps the set sorted.

Input Size (n)	Approx. Operations
10	About 4 steps
100	About 7 steps
1000	About 10 steps

Pattern observation: The steps grow slowly as the queue grows, not doubling or squaring.

Final Time Complexity

Time Complexity: O(log n)

This means adding or removing a task takes a little more time as the queue grows, but it grows slowly and stays efficient.

Common Mistake

[X] Wrong: "Adding or removing tasks in Redis priority queue is instant and always the same time."

[OK] Correct: Redis uses a sorted set that keeps tasks ordered, so it needs more steps as the queue grows, but it does this efficiently with a slow growth.

Interview Connect

Understanding how Redis handles priority queues helps you explain efficient data handling in real apps, showing you know how to manage growing data smoothly.

Self-Check

"What if we used a simple list instead of a sorted set for the priority queue? How would the time complexity change?"

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