SETNX for set-if-not-exists in Redis - Time & Space Complexity

Time Complexity: SETNX for set-if-not-exists

O(1)

Understanding Time Complexity

We want to understand how the time it takes to run the SETNX command changes as we add more data.

Specifically, how does SETNX behave when checking if a key exists before setting it?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

# Try to set a key only if it does not exist
SETNX mykey "some value"

# If the key does not exist, it will be set to "some value"
# If the key exists, the command does nothing
    

This code tries to set a key only if it is not already present in the database.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Checking if the key exists and setting it if not.
• How many times: This happens once per command call.

How Execution Grows With Input

The command checks the key directly without scanning other keys, so the time does not grow with the number of keys.

Input Size (n)	Approx. Operations
10	1 check + 1 set (if key missing)
100	1 check + 1 set (if key missing)
1000	1 check + 1 set (if key missing)

Pattern observation: The number of operations stays about the same no matter how many keys are in the database.

Final Time Complexity

Time Complexity: O(1)

This means the command runs in constant time, quickly checking and setting the key regardless of database size.

Common Mistake

[X] Wrong: "SETNX takes longer as the database grows because it searches all keys."

[OK] Correct: SETNX uses a direct key lookup, so it does not scan all keys and runs in constant time.

Interview Connect

Understanding how commands like SETNX work quickly helps you explain efficient data operations clearly and confidently.

Self-Check

"What if we changed SETNX to a command that scans all keys before setting? How would the time complexity change?"