Shadowing Practice: What Is Redis Really About? Why Is It So Popular? - Learn English Speaking with Video
בחר מצב תרגול
כל מצב פותח חדר תרגול במסך מלא.
159 משפטים
אם המשפטים קצרים או ארוכים מדי, לחץ על ערוך כדי להתאים אותם.
1
What is Redis?
2
Why does it show up in so many system design problems?
3
And why do so many teams rely on it in production?
4
Redis is versatile.
5
It's worth the time to learn it well.
6
In this video, we focus on three ideas.
7
How Redis executes commands, how it stores and persists data,
8
and how people use it in real systems.
9
Let's start with what Redis is.
10
Redis is a single-threaded, in-memory data structure server.
11
This short description hides three important design choices.
12
First, single thread execution.
13
Redis processes commands one at a time in a single thread.
14
Strictly speaking, Redis 6 and newer added IO threads for networking,
15
but the actual command logic still runs sequentially.
16
The order is predictable.
17
The first request in is the first request processed.
18
There are no logs to reason about and no concurrent writes to the same key.
19
If one command blocks, every other command waits behind it.
20
You might ask, if Redis uses only one thread to run commands,
21
how does it stay fast?
22
Redis hides latency with batching.
23
Clients can bundle commands with pipelining or wrap a set of commands in a transaction.
24
One network roundtrip now carries many commands.
25
The single thread still executes each command in order,
26
but the socket stays busy instead of waiting for each request-response pair.
27
Second, Redis keeps data in RAM.
28
The upside is very low latency.
29
Redis can respond in sub-millisecond time,
30
even when we send hundreds of commands per second.
31
The downside is durability.
32
If the machine dies, the data in memory is gone unless we configure persistence carefully.
33
This trade-off is central to how teams use Redis.
34
We'll come back to this.
35
Third, Redis is a key value store that exposes data structures directly.
36
A value in Redis can be many things.
37
For example, it can be a string,
38
a list, a hash, a set,
39
a sort of set, or a stream.
40
The protocol is small and simple,
41
but Redis provides many specialized commands for each data structure.
42
Here is a simple example of a counter.
43
We call setCounter5 getCounterReturns5.
44
IncrementCounter bumps it atomically to 6.
45
Each command acts on a key.
46
Atomicity matters when multiple clients touch the same key.
47
Because Redis runs commands one at a time,
48
increment completes as a single atomic step.
49
Multiple clients incrementing the same counter won't interfere with each other.
50
Now let's move on to persistent and durability.
51
Since Redis lives in memory,
52
we need to plan for crashes.
53
Different teams make different choices.
54
Many teams run Redis as a pure cache with persistence turned off.
55
The database is the source of truth.
56
Rights go to the database.
57
Redis only stores cached results.
58
If Redis crashes in this setup, we lose the cache.
59
The application rebuilds it on demand by querying the database.
60
No important data is lost because we never treated Redis as the source of truth.
61
Some teams skip this persistence but add replicas.
62
The primary node handles all writes.
63
Replicas handle read traffic.
64
If the primary dies, a replica is promoted to replace it.
65
In this case, we may lose availability for a few seconds during failover,
66
but we preserve most of the cache data in memory on the replicas.
67
This trace this ILOverhead for memory overhead.
68
Each replica roughly doubles the memory footprint.
69
Another option is to enable RDB snapshots.
70
We configure Redis to take a snapshot every few minutes.
71
On restart, Redis loads the snapshot into memory.
72
This allows Redis to come back with warm data instead of an empty cache.
73
We accept losing the writes that happened after the last snapshot.
74
For a cache workload, this is usually a reasonable trade-off because the cache warms up quite quickly.
75
When Redis holds data we cannot afford to lose,
76
we turn on the append-only file.
77
A common configuration is append only yes with append fsync every sec.
78
Redis appends each write to a log on disk.
79
The operating system flushes buffer write to disk roughly once per second.
80
In a crash, we lose at most 1 second of data.
81
We can configure fsync after every command for a stronger durability.
82
But that is much slower and has a big impact on throughput.
83
Most teams avoid that unless the dataset is small and latency is not critical.
84
In practice, the real question is whether Redis should hold critical state at all
85
or whether it should just be used as a cache.
86
Many teams keep critical data in a durable database and rely on Redis mainly for caching and ephemeral state.
87
That covers persistence.
88
Next, let's talk about scaling Redis.
89
Most Most teams start with a single Redis instance.
90
On decent hardware, a single node can handle a large number of operations per second for many workloads.
91
When reads become the bottleneck,
92
the first scaling step is to add replicas.
93
The primary node accepts all writes.
94
Repicas serve read traffic.
95
This increases read throughput, but write throughput is still capped by the primary.
96
When write volume grows too large for a single instance,
97
many teams adopt client-side sharding.
98
We run multiple independent Redis instances.
99
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.
הורד אפליקציה
כל מה שאתה צריך כדי לדבר בשטף
הגיית AIציון לכל משפט
תרגול IPAשלוט בכל צליל
אוצר מיליםבנה את מאגר המילים שלך
משחק אוצר מיליםלמד תוך כדי משחק
אותו ערוץ
C13
Proxy vs Reverse Proxy (Real-world Examples)
Daily ConversationUniversity StudentsWorking Adults
C12
Cache Systems Every Developer Should Know
Daily ConversationUniversity StudentsWorking Adults
C12
Top 5 Redis Use Cases
Daily ConversationUniversity Students
C13
Everything You Need to Know About DNS: Crash Course System Design #4
Daily ConversationUniversity StudentsWorking Adults
C12
CAP Theorem Simplified
Daily ConversationUniversity StudentsWorking Adults
C12
What Is REST API? Examples And How To Use It: Crash Course System Design #3
Daily ConversationUniversity StudentsWorking Adults
C18
8 Most Important System Design Concepts You Should Know
Daily ConversationUniversity StudentsWorking Adults
C11
The Secret Sauce Behind NoSQL: LSM Tree
Daily ConversationUniversity StudentsWorking Adults
C11
System Design: Why is Kafka fast?
Business EnglishUniversity StudentsWorking Adults
C16
What Are Microservices Really All About? (And When Not To Use It)
Business EnglishUniversity StudentsWorking Adults
C13
System Design Was HARD - Until You Knew the Trade-Offs
Daily ConversationUniversity StudentsWorking Adults
C13
How Does a URL Shortener Work?
Business EnglishInterview EnglishUniversity Students
C13
System Design: Why is Kafka Popular?
Business EnglishUniversity StudentsWorking Adults
C14
What is API Gateway?
Business EnglishUniversity StudentsWorking Adults
C12
10+ Key Memory & Storage Systems: Crash Course System Design #5
University StudentsWorking Adults
C150
Kubernetes Explained in 6 Minutes | k8s Architecture
Business EnglishUniversity StudentsWorking Adults
B2How Git Works: Explained in 4 Minutes
Business EnglishUniversity StudentsWorking Adults
FOR YOU
המלץ על סרטון
C1231 משפטים
Redis Crash Course - the What, Why and How to use Redis as your primary database
Daily ConversationUniversity StudentsWorking Adults
C13
80 משפטים
What is clean code? - Uncle Bob
Business EnglishUniversity StudentsWorking Adults
C22
129 משפטים
2.2k
Business EnglishUniversity StudentsWorking Adults
C12
108 משפטים
Neuroscientist's Guide To 10X Your Focus & Memory | Dr Sahar Yousef | FO559 Raj Shamani
Business EnglishUniversity StudentsWorking Adults
C11
186 משפטים
Why Shopify Moved Inventory Reservations from Redis to MySQL
Business EnglishUniversity StudentsWorking Adults
C14
25 משפטים
DNS Explained in 100 Seconds
American AccentBusiness EnglishUniversity StudentsWorking Adults
C12
32 משפטים
Rust in 100 Seconds
American AccentBusiness EnglishUniversity StudentsWorking Adults
C21
83 משפטים
PostgreSQL Architecture Explained: Deep Dive for Beginners
Business EnglishUniversity StudentsWorking Adults
C12
130 משפטים
Password Storage Tier List: encryption, hashing, salting, bcrypt, and beyond
Business EnglishUniversity StudentsWorking Adults
C26
87 משפטים
Every NestJS Concept Explained in 9 Minutes
Business EnglishUniversity StudentsWorking Adults
אוצר מילים והערות הגייה לשיעור הזה
שיעור הדיבור הזה ברמה C2 מבוסס על הסרטון “What Is Redis Really About? Why Is It So Popular?”. המילים שחוזרות הכי הרבה: Redis, command, cache, key, teams. בסרטון הזה יש 159 משפטים ו-1411 מילים לתרגול Shadowing. הדיבור נמשך 8:58. הדובר מדבר בקצב טבעי של כ-157 מילים בדקה, קרוב לשיחה יומיומית. רק 70% מהמילים נמצאות בין 3,000 המילים הנפוצות ביותר באנגלית, כך שאוצר המילים מאתגר.
אוצר מילים מרכזי בסרטון הזה
15 המילים המתקדמות ביותר בסרטון, עם ההגייה והמשמעות שלהן:
| מילה | הגייה | משמעות |
|---|---|---|
| cache שם עצם | /kæʃ/ | מִצְבּוֹר, מַחְבּוֹא |
| hash שם עצם | /ˈhæʃ/ | סוּלָּמִית |
| shard שם עצם | /ˈʃɑːd/ | רְסִיס |
| increment שם עצם | /ˈɪŋkɹɪmn̩t/ | תוספת |
| coordination שם עצם | /kəʊˌɔːdɪˈneɪʃən/ | תיאום |
| execute פועל | /ˈɛksɪˌkjuːt/ | להוציא להרוג |
| atomic שם תואר | /əˈtɑː.mɪk/ | אָטוֹמִי |
| disk שם עצם | /dɪsk/ | דִּיסְק |
| concurrent שם תואר | /kəŋˈkʌɹənt/ | מַקְבִּיל |
| ephemeral שם תואר | /ɛˈfɛ.mə.ɹəl/ | בֶּן חֲלוֹף |
| dedicate פועל | /ˈdɛdɪˌkeɪt/ | הקדיש |
| socket שם עצם | /ˈsɑkɪt/ | שֶׁקַע |
| footprint שם עצם | /ˈfʊtpɹɪnt/ | עָקֵב, טְבִיעַת רֶגֶל |
| subset שם עצם | /ˈsʌbˌsɛt/ | תת קבוצה |
| distribute פועל | /dɪˈstɹɪbjuːt/ | חילק |
הגייה ששווה לשים לב אליה
- הצלילים של “th”: throughput /ˈθɹuː.pʊt/, logarithmic /ˌlɒɡəˈɹɪðmɪk/, algorithm /ˈælɡəɹɪðm̩/
- הצלילים של “sh” ו-“zh”: cache /kæʃ/, hash /ˈhæʃ/, shard /ˈʃɑːd/, snapshot /ˈsnæpʃɒt/, coordination /kəʊˌɔːdɪˈneɪʃən/
- מילים ארוכות — שימו לב להטעמה: durability /dəɹəˈbɪləti/, predictable /pɹəˈdɪktəbləl/, coordination /kəʊˌɔːdɪˈneɪʃən/, atomicity /ˌætəˈmɪsɪti/, ephemeral /ɛˈfɛ.mə.ɹəl/
צלילים שדוברי עברית מתקשים בהם:
- /w/ — שפתיים מעוגלות, לא /v/: query /ˈkwɪɹ.i/, sequentially /səˈkwɛntʃəli/
- /æ/ — פתוח יותר מה-“אֶ” העברית, לא כמו “a” ב-“cup”: cache /kæʃ/, hash /ˈhæʃ/, snapshot /ˈsnæpʃɒt/, atomicity /ˌætəˈmɪsɪti/, batch /bæt͡ʃ/
- /r/ — הלשון לא נוגעת בשום מקום, לא ה-“ר” הגרונית: replica /ˈɹɛplɪkə/, configure /kənˈfɪɡə(ɹ)/, throughput /ˈθɹuː.pʊt/, durability /dəɹəˈbɪləti/, increment /ˈɪŋkɹɪmn̩t/
איך לתרגל עם הסרטון הזה
- הקשיבו לכל הסרטון פעם אחת בלי לדבר, ורשמו את המילים שאתם לא מכירים.
- התחילו במהירות 0.75×, תרגלו Shadowing משפט אחר משפט, וחזרו למהירות רגילה כשזה מרגיש קל.
- הקליטו את עצמכם והשוו למקור, תוך תשומת לב למילים כמו cache, hash, shard.
מהי טכניקת השאדואינג?
שאדואינג היא טכניקת למידת שפה מבוססת מדע שפותחה במקור להכשרת מתורגמנים מקצועיים ופופולרית על ידי הפוליגלוט ד"ר אלכסנדר ארגואלס. השיטה פשוטה אך עוצמתית: אתה מקשיב לאודיו באנגלית ילידית וחוזר עליו בקול רם מיד — כמו צל העוקב אחרי הדובר עם עיכוב של 1–2 שניות בלבד. בניגוד להאזנה פסיבית או תרגילי דקדוק, שאדואינג מכריח את המוח והשרירים בפה לעבד ולשחזר דפוסי דיבור אמיתיים בו זמנית. מחקרים מראים שזה משפר משמעותית את דיוק ההגייה, האינטונציה, הקצב, הדיבור המחובר, הבנת השמיעה ושטף הדיבור — מה שהופך אותו לאחת השיטות היעילות ביותר להכנה לIELTS Speaking ולתקשורת באנגלית בעולם האמיתי.