📖 Scenario: You are building a simple event queue system using Redis to schedule and process events based on their scheduled time. This is useful for reminders, notifications, or delayed tasks.
🎯 Goal: Create a Redis sorted set to hold events with their scheduled timestamps, add events with exact timestamps, retrieve events that are due up to the current time, and remove processed events from the queue.
📋 What You'll Learn
Create a Redis sorted set named event_queue to store events with their scheduled timestamps as scores.
Add three events with exact timestamps to event_queue using ZADD.
Retrieve all events from event_queue that are scheduled up to a given timestamp using ZRANGEBYSCORE or ZREVRANGEBYSCORE.
Remove processed events from event_queue using ZREMRANGEBYSCORE.
💡 Why This Matters
🌍 Real World
Time-based event queues are used in real applications like scheduling notifications, reminders, or delayed jobs in web services.
💼 Career
Understanding Redis sorted sets and time-based event queues is valuable for backend developers and DevOps engineers managing task scheduling and real-time systems.
Progress0 / 4 steps
1
Create the event queue sorted set
Create a Redis sorted set named event_queue to hold events with their scheduled timestamps as scores. Add these three events with their exact timestamps using ZADD: event1 at 1686000000, event2 at 1686003600, and event3 at 1686007200.
Redis
Hint
Use the ZADD command with the sorted set name event_queue, followed by the timestamp and event name pairs.
2
Set the current timestamp for event retrieval
Create a variable named current_time and set it to 1686003600. This will be used to retrieve all events scheduled up to this timestamp.
Redis
Hint
Use the SET command to create a key current_time with the value 1686003600.
3
Retrieve due events from the queue
Use the ZRANGEBYSCORE command to retrieve all events from event_queue with scores less than or equal to the value stored in current_time. Use -inf as the min score and current_time as the max score to get all due events.
Redis
Hint
Use ZRANGEBYSCORE with -inf as the minimum and 1686003600 as the maximum score to get all events up to that time.
4
Remove processed events from the queue
Use the ZREMRANGEBYSCORE command to remove all events from event_queue with scores less than or equal to the value stored in current_time.
Redis
Hint
Use ZREMRANGEBYSCORE with -inf and 1686003600 to remove all events up to that timestamp.
Practice
(1/5)
1. What is the main purpose of using a Redis sorted set for a time-based event queue?
easy
A. To store events in a hash for quick lookup
B. To store events with timestamps as scores for ordered retrieval
C. To store only unique event names without timestamps
D. To store events without any order
Solution
Step 1: Understand Redis sorted sets
Redis sorted sets store members with a score that determines their order.
Step 2: Apply to time-based event queues
Using timestamps as scores allows events to be retrieved in chronological order.
Final Answer:
To store events with timestamps as scores for ordered retrieval -> Option B
Hint: Remember: sorted sets order by score (timestamp) [OK]
Common Mistakes:
Thinking sorted sets don't keep order
Confusing hashes with sorted sets
Ignoring the timestamp as score
2. Which Redis command correctly adds an event with a timestamp score to a sorted set named events?
easy
A. SADD events 1625097600 "event1"
B. HSET events 1625097600 "event1"
C. ZADD events 1625097600 "event1"
D. LPUSH events 1625097600 "event1"
Solution
Step 1: Identify the command for sorted sets
ZADD adds members with scores to sorted sets; others are for different data types.
Step 2: Check syntax correctness
ZADD events 1625097600 "event1" adds "event1" with score 1625097600 to sorted set events.
Final Answer:
ZADD events 1625097600 "event1" -> Option C
Quick Check:
ZADD = add to sorted set [OK]
Hint: Use ZADD for sorted sets, not SADD or HSET [OK]
Common Mistakes:
Using SADD which is for sets without scores
Using HSET which is for hashes
Using LPUSH which is for lists
3. Given the sorted set events with members and scores: {"event1": 1000, "event2": 1500, "event3": 2000} What will the command ZREVRANGEBYSCORE events 1500 -inf return?
medium
A. ["event1"]
B. ["event3", "event2", "event1"]
C. ["event1", "event2"]
D. ["event2", "event1"]
Solution
Step 1: Understand ZREVRANGEBYSCORE command
This command returns members with scores between max and min in descending order.
Step 2: Apply to given scores
Scores ≤ 1500 are event1 (1000) and event2 (1500). Descending order: event2, event1.
Final Answer:
["event2", "event1"] -> Option D
Quick Check:
Descending scores ≤ 1500 = event2, event1 [OK]
Hint: ZREVRANGEBYSCORE returns descending order by score [OK]
Common Mistakes:
Confusing ascending with descending order
Including events with scores above max
Misreading score boundaries
4. You run this Redis command to fetch due events: ZREVRANGEBYSCORE events 1625097600 -inf But you notice the same events are returned repeatedly. What is the likely mistake?
medium
A. Not removing processed events from the sorted set
B. Using ZREVRANGEBYSCORE instead of ZRANGEBYSCORE
C. Using the wrong key name for the sorted set
D. Using a timestamp that is too high
Solution
Step 1: Understand event queue behavior
After processing events, they must be removed to avoid duplicates.
Step 2: Identify cause of repeated events
If events are not removed, the same events appear on every fetch.
Final Answer:
Not removing processed events from the sorted set -> Option A
Quick Check:
Remove events after processing to avoid repeats [OK]
Hint: Always delete processed events from sorted set [OK]
Common Mistakes:
Thinking order command causes repeats
Ignoring event removal step
Assuming wrong key name causes repeats
5. You want to implement a Redis time-based event queue that fetches all events due up to now and removes them atomically to avoid duplicates. Which sequence of commands is best?
hard
A. Use ZRANGEBYSCORE to get events ≤ now, then ZREM to remove them
B. Use ZREVRANGEBYSCORE to get events ≥ now, then ZREM to remove them
C. Use ZRANGEBYSCORE with a future timestamp, then LPUSH to add events
D. Use SPOP to pop events from a set
Solution
Step 1: Fetch due events with ZRANGEBYSCORE
ZRANGEBYSCORE with max = current timestamp fetches all events due up to now.
Step 2: Remove fetched events with ZREM
Removing them prevents duplicates; doing both steps atomically avoids race conditions.
Final Answer:
Use ZRANGEBYSCORE to get events ≤ now, then ZREM to remove them -> Option A
Quick Check:
Fetch ≤ now + remove = atomic event processing [OK]
Hint: Fetch with ZRANGEBYSCORE ≤ now, then remove with ZREM [OK]
Common Mistakes:
Using ZREVRANGEBYSCORE with wrong score range
Using sets or lists instead of sorted sets
Not removing events after fetching
Recommended
Ready to prove it?
Pass the test and this pattern moves unknownstrongwhile earning +1 Grip toward your certificate.