Hash tables in caching (Redis, Memcached) in Data Structures Theory - Time & Space Complexity

Time Complexity: Hash tables in caching (Redis, Memcached)

O(1)

Understanding Time Complexity

When using hash tables in caching systems like Redis or Memcached, it is important to understand how fast data can be stored and retrieved.

We want to know how the time to find or save data changes as the amount of cached data grows.

Scenario Under Consideration

Analyze the time complexity of these basic hash table operations.

function cacheSet(key, value) {
  index = hashFunction(key)
  bucket = table[index]
  for (item of bucket) {
    if (item.key == key) {
      item.value = value
      return
    }
  }
  bucket.push({key: key, value: value})
}

function cacheGet(key) {
  index = hashFunction(key)
  bucket = table[index]
  for (item of bucket) {
    if (item.key == key) return item.value
  }
  return null
}
    

This code shows how caching systems use a hash function to find where data is stored and then search a small list (bucket) for the exact key.

Identify Repeating Operations

• Primary operation: Looping through the bucket (a small list) to find the key.
• How many times: Depends on the number of items in the bucket, usually very few if the hash function spreads keys well.

How Execution Grows With Input

As more items are cached, the table grows, but each bucket stays small if the hash spreads keys evenly.

Input Size (n)	Approx. Operations
10	About 1 to 2 checks per lookup
100	Still about 1 to 2 checks per lookup
1000	Still about 1 to 2 checks per lookup

Pattern observation: The number of checks stays roughly the same because the hash table spreads data evenly, keeping lookups fast.

Final Time Complexity

Time Complexity: O(1)

This means that storing or retrieving data takes about the same short time no matter how much data is cached.

Common Mistake

[X] Wrong: "Hash table lookups always take the same time no matter what."

[OK] Correct: If many keys end up in the same bucket (called collisions), the lookup time can grow because it must check more items in that bucket.

Interview Connect

Understanding how hash tables keep cache lookups fast helps you explain why systems like Redis are so efficient and how to reason about performance in real applications.

Self-Check

"What if the hash function is poor and many keys collide into the same bucket? How would the time complexity change?"

Practice

1. What is the main purpose of using hash tables in caching systems like Redis or Memcached?

easy

A. To compress data to save space

B. To sort data alphabetically

C. To encrypt data for security

D. To store data with keys for fast retrieval

Solution

1. Step 1: Understand the role of hash tables

   Hash tables store data in key-value pairs allowing quick access by key.

2. Step 2: Identify caching system goals

   Caching systems aim to speed up data retrieval, which hash tables support by fast key lookup.

3. Final Answer:

   To store data with keys for fast retrieval -> Option D

4. Quick Check:

   Hash tables = fast key-based access [OK]

Hint: Hash tables = fast key lookup in cache [OK]

Common Mistakes:

• Confusing caching with data compression
• Thinking hash tables sort data
• Assuming hash tables encrypt data

2. Which of the following is the correct way to describe a hash table's structure?

easy

A. A key-value store where keys map to values

B. A list of values sorted by size

C. A queue where elements are processed FIFO

D. A stack where elements are processed LIFO

Solution

1. Step 1: Recall hash table definition

   A hash table stores data as key-value pairs for quick access.

2. Step 2: Compare options to definition

   Only the key-value store where keys map to values correctly describes a key-value mapping structure.

3. Final Answer:

   A key-value store where keys map to values -> Option A

4. Quick Check:

   Hash table = key-value pairs [OK]

Hint: Hash tables always map keys to values [OK]

Common Mistakes:

• Confusing hash tables with lists or queues
• Mixing up FIFO and LIFO with hash tables
• Thinking hash tables sort data automatically

3. Consider a caching system using a hash table. If two different keys produce the same hash index, what is this situation called?

medium

A. Underflow

B. Overflow

C. Collision

D. Timeout

Solution

1. Step 1: Understand hash function behavior

   Hash functions map keys to indexes; sometimes different keys map to the same index.

2. Step 2: Identify the term for same index mapping

   This event is called a collision in hash tables.

3. Final Answer:

   Collision -> Option C

4. Quick Check:

   Same index for keys = Collision [OK]

Hint: Same index for keys means collision [OK]

Common Mistakes:

• Confusing collision with overflow or underflow
• Thinking timeout relates to hash indexing
• Assuming collisions never happen

4. A Redis cache uses a hash table but sometimes returns incorrect data for a key. Which of the following is the most likely cause?

medium

A. Keys are sorted incorrectly

B. Hash collision not handled properly

C. Cache size is too large

D. Data is encrypted

Solution

1. Step 1: Analyze incorrect data retrieval

   Incorrect data usually means the wrong value is returned for a key.

2. Step 2: Identify common hash table issue

   If collisions are not handled properly, keys may overwrite or mix values causing errors.

3. Final Answer:

   Hash collision not handled properly -> Option B

4. Quick Check:

   Collision handling error = wrong data [OK]

Hint: Check collision handling if cache returns wrong data [OK]

Common Mistakes:

• Blaming cache size for wrong data
• Thinking sorting keys affects hash retrieval
• Assuming encryption causes wrong values

5. You want to design a caching system using a hash table that minimizes collisions. Which approach is best to achieve this?

hard

A. Use a good hash function and increase table size

B. Store data in a linked list instead of a hash table

C. Sort keys before inserting into the hash table

D. Encrypt keys before hashing

Solution

1. Step 1: Understand collision causes

   Collisions happen when different keys map to the same index due to poor hashing or small table size.

2. Step 2: Identify best practices to reduce collisions

   Using a strong hash function and a larger table reduces collisions effectively.

3. Step 3: Evaluate other options

   Linked lists do not reduce collisions; sorting keys or encrypting keys does not prevent collisions.

4. Final Answer:

   Use a good hash function and increase table size -> Option A

5. Quick Check:

   Good hash + big table = fewer collisions [OK]

Hint: Better hash + bigger table = fewer collisions [OK]

Common Mistakes:

• Thinking sorting keys prevents collisions
• Assuming encryption affects collision rate
• Replacing hash table with linked list to avoid collisions