Embedding vs referencing in Redis

Introduction

Embedding and referencing are two ways to store related data in Redis. They help organize data for easy access and updates.

When you want to store all related information together for quick access.

When data is small and changes together, embedding is easier.

When data is large or shared across many places, referencing avoids duplication.

When you want to update parts of data independently.

When you want to keep your data organized and avoid repeating the same info.

Syntax

Redis

Embedding: Store related data inside one Redis key, often as a hash or JSON string.
Referencing: Store related data in separate keys and link them using IDs or keys.

Embedding keeps data together, so you get everything with one read.

Referencing stores data separately, so you can update parts without touching others.

Examples

This example embeds user details in one hash key.

Redis

HSET user:1000 name "Alice" age 30 address "123 Main St"

This example references the address separately by storing it in another key.

Redis

HSET user:1000 name "Alice" age 30
SET address:1000 "123 Main St"

Sample Program

This shows embedding user info in one hash and referencing address in another. You get user data and address separately.

Redis

HSET user:1 name "Bob" age 25
HSET address:1 street "456 Oak Rd" city "Springfield"

# To get embedded data:
HGETALL user:1

# To get referenced data:
HGETALL user:1
HGETALL address:1

Important Notes

Embedding is faster for reading all data at once.

Referencing is better when parts of data change often or are shared.

Choose based on how you use and update your data.

Summary

Embedding stores related data together in one key.

Referencing stores related data in separate keys linked by IDs.

Use embedding for simple, small, and tightly connected data.

Practice

1. Which statement best describes embedding in Redis?

easy

A. Storing related data together in one key.

B. Storing data in separate keys linked by IDs.

C. Using multiple databases for related data.

D. Storing only references without actual data.

Solution

1. Step 1: Understand embedding concept

   Embedding means putting related data inside one Redis key, so all data is together.

2. Step 2: Compare with referencing

   Referencing stores data separately and links them by IDs, which is different from embedding.

3. Final Answer:

   Storing related data together in one key. -> Option A

4. Quick Check:

   Embedding = data together [OK]

Hint: Embedding means one key holds all related data [OK]

Common Mistakes:

• Confusing embedding with referencing
• Thinking embedding uses multiple keys
• Assuming embedding stores only IDs

2. Which Redis data structure is best suited for embedding small related data together?

easy

A. Sorted Set

B. String

C. List

D. Hash

Solution

1. Step 1: Identify data structure for embedding

   Hashes store multiple fields and values inside one key, ideal for embedding related small data.

2. Step 2: Compare other structures

   Strings hold single values, Lists and Sorted Sets are for ordered collections, less suited for embedding small related fields.

3. Final Answer:

   Hash -> Option D

4. Quick Check:

   Embedding small data = Hash [OK]

Hint: Use Hash for embedding small related fields [OK]

Common Mistakes:

• Choosing String for multiple fields
• Confusing List with Hash
• Using Sorted Set without score relevance

3. Given these Redis commands:

HSET user:100 name "Alice" age 30
HSET user:100:address city "NY" zip 10001

Which describes the data design?

medium

A. Referencing address data in a separate key

B. Embedding all user data in one key

C. Using a List to store user info

D. Storing user data as a String

Solution

1. Step 1: Analyze keys and data

   user:100 holds name and age, user:100:address holds address fields separately.

2. Step 2: Identify design pattern

   Address is stored in a separate key linked by user ID, which is referencing.

3. Final Answer:

   Referencing address data in a separate key -> Option A

4. Quick Check:

   Separate keys linked by ID = referencing [OK]

Hint: Separate keys with related IDs mean referencing [OK]

Common Mistakes:

• Thinking all data is embedded in one key
• Confusing List with Hash usage
• Assuming address is embedded inside user key

4. You want to store user profiles with embedded address data in Redis using hashes. Which command has an error?

medium

A. HSET user:200 name "Bob" age 25

B. HSET user:200:address city "LA" zip 90001

C. HSET user:200 name "Bob" city "LA" zip 90001

D. HSET user:200 name "Bob" age 25 city "LA" zip 90001

Solution

1. Step 1: Check embedding address in user hash

   Embedding means all fields in one key, so address fields city and zip should be in user:200 hash.

2. Step 2: Identify error in command C

   Command C uses a separate key user:200:address, storing address separately linked by ID. This is referencing, not embedding.

3. Final Answer:

   HSET user:200:address city "LA" zip 90001 -> Option B

4. Quick Check:

   Separate keys = referencing, not embedding [OK]

Hint: Embedding: all data in ONE key, no sub-keys [OK]

Common Mistakes:

• Missing value for a field
• Using separate keys when embedding
• Mixing field-value pairs incorrectly

5. You have a Redis database storing product info. You want to optimize for fast reads of product details including reviews. Which design is best?

hard

A. Embed product details and all reviews in one hash key per product.

B. Store all reviews in a single list key for all products.

C. Store product details in one hash and each review in separate keys linked by product ID.

D. Store product details as strings and reviews as sorted sets.

Solution

1. Step 1: Consider data size and access pattern

   Reviews can be many and large, embedding all in one key can cause large data and slow updates.

2. Step 2: Choose referencing for scalability

   Storing product details separately and reviews in linked keys allows efficient updates and reads without large keys.

3. Step 3: Evaluate other options

   Embedding all reviews in one hash risks large keys; storing all reviews in a single list key for all products mixes products; storing product details as strings and reviews as sorted sets don't fit review structure well.

4. Final Answer:

   Store product details in one hash and each review in separate keys linked by product ID. -> Option C

5. Quick Check:

   Large related data = referencing for performance [OK]

Hint: Large or many related items? Use referencing [OK]

Common Mistakes:

• Embedding large lists causing slow reads
• Mixing all reviews in one key
• Ignoring update frequency of reviews