HSET and HGET for fields in Redis - Deep Dive

Overview - HSET and HGET for fields

What is it?

HSET and HGET are commands in Redis used to work with hashes, which are like small dictionaries inside Redis. HSET adds or updates a field with a value inside a hash, and HGET retrieves the value of a specific field from that hash. This lets you store and access related pieces of information together under one key.

Why it matters

Without HSET and HGET, you would have to store each piece of related data as separate keys, making it harder to organize and slower to access. These commands help keep data grouped logically, improving speed and simplicity when working with structured data in Redis.

Where it fits

Before learning HSET and HGET, you should understand basic Redis keys and string commands. After mastering these, you can explore more complex hash commands, other data types like lists and sets, and how to use Redis in real applications.

Mental Model

Core Idea

HSET and HGET let you store and retrieve named fields inside a single Redis key, like labeled boxes inside one container.

Think of it like...

Imagine a filing cabinet drawer labeled with a person's name (the Redis key). Inside the drawer, there are folders labeled with different topics (fields), and each folder holds papers (values). HSET puts papers into a folder, and HGET finds the papers in a folder.

┌───────────────┐
│ Redis Key     │
│ (e.g., 'user1')│
│               │
│ ┌───────────┐ │
│ │ Field:    │ │
│ │ 'name'    │ │
│ │ Value:    │ │
│ │ 'Alice'   │ │
│ └───────────┘ │
│ ┌───────────┐ │
│ │ Field:    │ │
│ │ 'age'     │ │
│ │ Value:    │ │
│ │ '30'      │ │
│ └───────────┘ │
└───────────────┘

Build-Up - 6 Steps

1

Foundation

Understanding Redis Hashes

Concept: Hashes are a data type in Redis that store multiple field-value pairs under one key.

In Redis, a hash is like a small dictionary or map. Instead of storing one value per key, you can store many fields and their values inside a single key. This helps organize related data together. For example, a user profile with name, age, and email can be stored as fields inside one hash key.

Result

You can think of a Redis hash as a container holding many labeled values under one name.

Understanding hashes is essential because HSET and HGET operate on these structures, enabling efficient grouping of related data.

2

Foundation

Basic Use of HSET Command

Concept: HSET adds or updates a field with a value inside a Redis hash key.

The HSET command syntax is: HSET key field value This command creates the hash if it doesn't exist and sets the field to the given value. If the field already exists, it updates the value. Example: HSET user1 name Alice HSET user1 age 30

Result

The hash 'user1' now has fields 'name' with 'Alice' and 'age' with '30'.

Knowing that HSET can create or update fields inside a hash helps you manage grouped data efficiently without separate keys.

3

Intermediate

Retrieving Data with HGET

🤔Before reading on: do you think HGET returns the whole hash or just one field's value? Commit to your answer.

Concept: HGET fetches the value of a specific field inside a Redis hash key.

The HGET command syntax is: HGET key field It returns the value stored in the given field of the hash. If the field or key does not exist, it returns nil. Example: HGET user1 name → returns 'Alice' HGET user1 age → returns '30' HGET user1 email → returns nil (field missing)

Result

You get the exact value stored in the requested field or nil if missing.

Understanding that HGET targets a single field inside a hash prevents confusion about retrieving data and helps you access only what you need.

4

Intermediate

Difference Between HSET and SET Commands

🤔Before reading on: do you think HSET and SET commands store data the same way? Commit to your answer.

Concept: HSET works on hashes with multiple fields, while SET stores a single string value per key.

SET key value stores one value per key. HSET key field value stores multiple fields inside one key. Example: SET user1 'Alice' stores just 'Alice' under 'user1'. HSET user1 name 'Alice' stores 'Alice' under field 'name' inside 'user1'. This means HSET lets you organize data better when you have many related pieces.

Result

You can choose between simple key-value or structured hash storage depending on your needs.

Knowing this difference helps you pick the right Redis command for your data structure and avoid messy or inefficient storage.

5

Advanced

Atomicity and Performance of HSET/HGET

🤔Before reading on: do you think HSET and HGET commands are atomic and fast? Commit to your answer.

Concept: HSET and HGET are atomic operations and very fast because Redis stores hashes efficiently in memory.

Redis executes each command fully before the next starts, so HSET and HGET are atomic. This means no partial updates or reads happen. Hashes are stored in a way that accessing or updating a field is very quick, even with many fields. This makes hashes ideal for real-time applications needing fast, consistent data access.

Result

You get reliable and speedy updates and reads on hash fields.

Understanding atomicity and performance ensures you trust these commands in critical, concurrent environments.

6

Expert

Memory Optimization and Internal Encoding

🤔Before reading on: do you think Redis always stores hashes the same way internally? Commit to your answer.

Concept: Redis uses different internal encodings for hashes depending on their size to optimize memory and speed.

Small hashes (few fields, small values) are stored in a compact ziplist format to save memory. When hashes grow large or fields/values are big, Redis switches to a hashtable encoding for faster access. This switch is automatic and invisible to users but affects memory use and performance. Knowing this helps when designing data models to keep hashes small for efficiency.

Result

Redis balances memory and speed by adapting hash storage internally.

Knowing internal encoding helps experts optimize Redis usage and troubleshoot unexpected memory or speed issues.

Under the Hood

Redis stores hashes as either ziplists or hashtables internally. When you run HSET, Redis checks if the hash exists and adds or updates the field in the internal structure. HGET looks up the field in this structure and returns the value. These operations happen in memory with O(1) or near O(1) time complexity, making them very fast. Redis commands are atomic, so each HSET or HGET completes fully before another command runs.

Why designed this way?

Redis was designed for speed and simplicity. Using hashes lets users group related data under one key, reducing the number of keys and network calls. The dual internal encoding balances memory use and access speed, adapting automatically to data size. Atomic commands prevent race conditions in concurrent environments, ensuring data consistency.

┌─────────────┐
│ Redis Server│
│             │
│ ┌─────────┐ │
│ │ Hash    │ │
│ │ Key:    │ │
│ │ 'user1' │ │
│ └─────────┘ │
│    │        │
│    ▼        │
│ ┌─────────┐ │
│ │ Internal│ │
│ │ Storage │ │
│ │ (ziplist│ │
│ │ or      │ │
│ │ hashtable)│
│ └─────────┘ │
│    │        │
│ ┌─────────┐ │
│ │ Fields  │ │
│ │ 'name'  │ │
│ │ 'age'   │ │
│ └─────────┘ │
└─────────────┘

Myth Busters - 4 Common Misconceptions

Quick: Does HGET return all fields in a hash or just one? Commit to your answer.

Common Belief: HGET returns the entire hash with all fields and values.

Reality: HGET returns only the value of one specified field inside the hash.

Why it matters: Expecting the whole hash causes inefficient code and confusion when only one field is returned.

Quick: Can HSET create a new hash if the key doesn't exist? Commit to your answer.

Common Belief: HSET only updates existing hashes and fails if the key is missing.

Reality: HSET creates the hash automatically if the key does not exist.

Why it matters: Knowing this prevents unnecessary checks or extra commands to create hashes before setting fields.

Quick: Does Redis store all hashes the same way internally? Commit to your answer.

Common Belief: All hashes are stored as hashtables regardless of size.

Reality: Small hashes use a compact ziplist encoding, switching to hashtables only when large.

Why it matters: Ignoring this can lead to inefficient memory use or unexpected performance if hashes grow too big.

Quick: Is HSET atomic and safe to use in concurrent environments? Commit to your answer.

Common Belief: HSET might cause race conditions if multiple clients update the same hash simultaneously.

Reality: Redis commands, including HSET, are atomic, so updates happen fully without interference.

Why it matters: Misunderstanding atomicity can lead to overcomplicated locking or transaction code.

Expert Zone

1

Redis switches hash encoding automatically based on size, but you can configure thresholds to optimize memory or speed.

2

HSET returns 1 if a new field was added and 0 if an existing field was updated, which can be used to track changes.

3

Using hashes reduces keyspace size, which improves Redis performance and memory fragmentation compared to many separate keys.

When NOT to use

Avoid hashes when fields or values are very large or when you need to frequently access many fields at once; in such cases, consider using Redis strings or other data types like JSON modules or external databases.

Production Patterns

In real systems, hashes store user profiles, session data, or configuration settings. Developers use HSET to update individual fields without overwriting the entire object and HGET to fetch only needed data, minimizing network traffic and memory use.

Connections

Key-Value Stores

HSET/HGET build on the key-value model by adding field-level granularity inside a key.

Understanding simple key-value storage helps grasp how hashes extend this model to organize related data efficiently.

JSON Objects

Hashes in Redis are similar to JSON objects with named fields and values.

Knowing JSON helps understand how hashes group data, but Redis hashes are faster and simpler for small structured data.

Hash Tables in Computer Science

Redis hashes use hash tables internally for fast field lookup.

Understanding hash tables explains why HGET and HSET are very fast operations.

Common Pitfalls

#1 Trying to get a whole hash with HGET instead of one field.

Wrong approach:

HGET user1

Correct approach:

HGET user1 name

Root cause:

Misunderstanding that HGET requires both key and field arguments.

#2 Using SET to store multiple related fields instead of HSET.

Wrong approach:

SET user1 'name:Alice,age:30'

Correct approach:

HSET user1 name Alice
HSET user1 age 30

Root cause:

Not knowing hashes allow structured storage inside one key.

#3 Assuming HSET overwrites the entire hash instead of just one field.

Wrong approach:

HSET user1 'name:Alice,age:30'

Correct approach:

HSET user1 name Alice
HSET user1 age 30

Root cause:

Confusing HSET syntax and thinking it accepts multiple fields in one call.

Key Takeaways

HSET and HGET let you store and retrieve individual fields inside a single Redis hash key, organizing related data efficiently.

HSET creates or updates fields atomically, while HGET fetches the value of one field, never the whole hash.

Redis stores small hashes compactly and switches encoding automatically to balance memory and speed.

Using hashes reduces the number of keys and network calls, improving performance and data organization.

Understanding these commands helps you design fast, scalable Redis data models for real-world applications.