शैडोइंग अभ्यास: What Is Redis Really About? Why Is It So Popular? - YouTube के साथ अंग्रेजी बोलना सीखें

⏸ रुका हुआ

What is Redis?

गति:

159 वाक्य

यदि वाक्य बहुत छोटे या लंबे हों, तो समायोजित करने के लिए Edit पर क्लिक करें।

What is Redis?

Why does it show up in so many system design problems?

And why do so many teams rely on it in production?

Redis is versatile.

It's worth the time to learn it well.

In this video, we focus on three ideas.

How Redis executes commands, how it stores and persists data,

and how people use it in real systems.

Let's start with what Redis is.

Redis is a single-threaded, in-memory data structure server.

This short description hides three important design choices.

First, single thread execution.

Redis processes commands one at a time in a single thread.

Strictly speaking, Redis 6 and newer added IO threads for networking,

but the actual command logic still runs sequentially.

The order is predictable.

The first request in is the first request processed.

There are no logs to reason about and no concurrent writes to the same key.

If one command blocks, every other command waits behind it.

You might ask, if Redis uses only one thread to run commands,

how does it stay fast?

Redis hides latency with batching.

Clients can bundle commands with pipelining or wrap a set of commands in a transaction.

One network roundtrip now carries many commands.

The single thread still executes each command in order,

but the socket stays busy instead of waiting for each request-response pair.

Second, Redis keeps data in RAM.

The upside is very low latency.

Redis can respond in sub-millisecond time,

even when we send hundreds of commands per second.

The downside is durability.

If the machine dies, the data in memory is gone unless we configure persistence carefully.

This trade-off is central to how teams use Redis.

We'll come back to this.

Third, Redis is a key value store that exposes data structures directly.

A value in Redis can be many things.

For example, it can be a string,

a list, a hash, a set,

a sort of set, or a stream.

The protocol is small and simple,

but Redis provides many specialized commands for each data structure.

Here is a simple example of a counter.

We call setCounter5 getCounterReturns5.

IncrementCounter bumps it atomically to 6.

Each command acts on a key.

Atomicity matters when multiple clients touch the same key.

Because Redis runs commands one at a time,

increment completes as a single atomic step.

Multiple clients incrementing the same counter won't interfere with each other.

Now let's move on to persistent and durability.

Since Redis lives in memory,

we need to plan for crashes.

Different teams make different choices.

Many teams run Redis as a pure cache with persistence turned off.

The database is the source of truth.

Rights go to the database.

Redis only stores cached results.

If Redis crashes in this setup, we lose the cache.

The application rebuilds it on demand by querying the database.

No important data is lost because we never treated Redis as the source of truth.

Some teams skip this persistence but add replicas.

The primary node handles all writes.

Replicas handle read traffic.

If the primary dies, a replica is promoted to replace it.

In this case, we may lose availability for a few seconds during failover,

but we preserve most of the cache data in memory on the replicas.

This trace this ILOverhead for memory overhead.

Each replica roughly doubles the memory footprint.

Another option is to enable RDB snapshots.

We configure Redis to take a snapshot every few minutes.

On restart, Redis loads the snapshot into memory.

This allows Redis to come back with warm data instead of an empty cache.

We accept losing the writes that happened after the last snapshot.

For a cache workload, this is usually a reasonable trade-off because the cache warms up quite quickly.

When Redis holds data we cannot afford to lose,

we turn on the append-only file.

A common configuration is append only yes with append fsync every sec.

Redis appends each write to a log on disk.

The operating system flushes buffer write to disk roughly once per second.

In a crash, we lose at most 1 second of data.

We can configure fsync after every command for a stronger durability.

But that is much slower and has a big impact on throughput.

Most teams avoid that unless the dataset is small and latency is not critical.

In practice, the real question is whether Redis should hold critical state at all

or whether it should just be used as a cache.

Many teams keep critical data in a durable database and rely on Redis mainly for caching and ephemeral state.

That covers persistence.

Next, let's talk about scaling Redis.

Most Most teams start with a single Redis instance.

On decent hardware, a single node can handle a large number of operations per second for many workloads.

When reads become the bottleneck,

the first scaling step is to add replicas.

The primary node accepts all writes.

Repicas serve read traffic.

This increases read throughput, but write throughput is still capped by the primary.

When write volume grows too large for a single instance,

many teams adopt client-side sharding.

We run multiple independent Redis instances.

The application hashes each key and picks a Redis node based on the hash.

100

For a static cluster, a simple modular hash works.

101

For dynamic scaling, libraries such as Katama use consistent hashing so that adding or removing a node does not reshuffle all keys.

102

Each node here is independent.

103

There is no cross-node coordination and no distributed protocol between Redis servers.

104

So we treat Redis as a cache,

105

a node failure simply causes cache misses for the subset of keys that live on that node until the cache repopulates.

106

Redis cluster also exists as an option,

107

it provides automatic sharding and failover.

108

But this comes with added complexity.

109

Operating and debugging a Redis cluster setup is also more complex than running independent nodes.

110

Because of this, many teams prefer simple client-side sharding for cache workloads

111

and only adopt Redis cluster when they need its specific guarantees.

112

Now let's review some common Redis workloads.

113

The classic use case is caching.

114

A service checks Redis before hitting the database.

115

If there is a cache hit,

116

we return the value immediately.

117

If there is a cache miss,

118

we query the database, store the result in Redis,

119

and return the response to the client.

120

Over time, the cache fills up.

121

We need a clean up strategy.

122

One approach is to set a time to live on each key.

123

After the TTL expires, the key stops being returned and is cleaned up lazily.

124

Another approach is to configure a memory limit and an eviction policy so that Redis evicts keys,

125

for example the least recently used one, when memory is full.

126

Multiple service instances can share counters through Redis.

127

We use atomic increment commands on keys that represent a user,

128

an IP, or an API token.

129

Combined with TTLs or Lua scripts,

130

we can implement various rate limiting algorithms without adding a separate coordination service.

131

There are many nuances here,

132

so we dedicate an entire video to this topic.

133

Check the link in the description.

134

So far, Redis looks like a fast key value store.

135

The data structure server part becomes powerful when we look at features like SORTASET.

136

Leaderboards are a common example.

137

A SORTASET maintains items order by score.

138

We can insert a player with a score,

139

update the score when it changes,

140

query the top-end players or look up a player's rank.

141

These operations typically run in logarithmic time relative to the size of the set.

142

This pattern generalizes well.

143

You can build trending post lists,

144

most active users, top sellers,

145

and many other top-end ranking problems on top of Sortaset.

146

Let's wrap up.

147

Redis is fast, predictable, and versatile.

148

Single-threaded execution keeps behavior simple to reason about.

149

In-memory storage delivers very low latency.

150

Native data structures such as hashes and Sortasets solve problems that would be clunky to implement in a relational database.

151

Most teams start with a single instance.

152

Ad replicas will read traffic and availability,

153

then use client-side sharding when they need more write throughput.

154

When we understand these trade-offs around execution,

155

persistence, and data structures, Redis fits cleanly into our system designs.

156

Ready to age your next technical interview?

157

Join our community where we offer comprehensive courses on system design,

158

coding, behavioral questions, machine learning, and object-oriented design.

159

more at bitebico.com.

शैडोइंग तकनीक क्या है?

शैडोइंग (Shadowing) एक विज्ञान-समर्थित भाषा सीखने की तकनीक है जो मूल रूप से पेशेवर दुभाषिया प्रशिक्षण के लिए विकसित की गई थी। विधि सरल लेकिन शक्तिशाली है: आप मूल अंग्रेज़ी ऑडियो सुनते हैं और तुरंत इसे ज़ोर से दोहराते हैं — जैसे वक्ता की छाया 1-2 सेकंड की देरी से। शोध से पता चलता है कि यह उच्चारण सटीकता, स्वर, लय, जुड़ी हुई ध्वनियाँ, सुनने की समझ और बोलने की प्रवाहशीलता में काफ़ी सुधार करता है।

ShadowingEnglish.com – अंग्रेज़ी शैडोइंग अभ्यास

शैडोइंग अभ्यास: What Is Redis Really About? Why Is It So Popular? - YouTube के साथ अंग्रेजी बोलना सीखें

प्रसंग और पृष्ठभूमि

प्रतिदिन की संवाद के लिए शीर्ष 5 वाक्यांश

चरण-दर-चरण शैडोइंग मार्गदर्शिका

शैडोइंग तकनीक क्या है?

शैडोइंग अभ्यास: What Is Redis Really About? Why Is It So Popular? - YouTube के साथ अंग्रेजी बोलना सीखें

ऐप डाउनलोड करें

प्रसंग और पृष्ठभूमि

प्रतिदिन की संवाद के लिए शीर्ष 5 वाक्यांश

चरण-दर-चरण शैडोइंग मार्गदर्शिका

शैडोइंग तकनीक क्या है?