ฝึกพูดภาษาอังกฤษด้วยเทคนิค Shadowing จากวิดีโอ: The Secret Sauce Behind NoSQL: LSM Tree

เลือกโหมดฝึก

แต่ละโหมดจะเปิดห้องฝึกแบบเต็มจอ

77 ประโยค
หากประโยคสั้นหรือยาวเกินไป กดที่ Edit เพื่อปรับแก้
1
NoSQL databases like Cassandra have exploded in popularity in recent years.
2
One driver is the insatiable demand to ingest huge amounts of
3
data from an ever-growing number of sources like mobile application and IoT devices.
4
The secret sauce behind many of these NoSQL databases is a data structure called Log Structure Merge Tree.
5
An LSM tree is optimized for fast writes.
6
To understand how an LSM tree works, let's first take a look at how data is typically stored in a relational database.
7
A relational database is commonly backed by a data structure called a B-tree.
8
A B-tree is optimized for reads.
9
Updating the B-tree is relatively expensive as it involves random I.O and might include updating multiple pages on disk.
10
This limits how fast a B tree can ingest data.
11
An LSM tree works differently.
12
Writes are bashed in memory as they arrive in a structure called a mem table.
13
A mem table is ordered by object key and is usually implemented as a balanced binary tree.
14
As a mem table reaches a certain size, it is flushed to disk as an immutable sorted string table.
15
An ss table stores the key value pairs in a sorted sequence.
16
These writes are all sequential I.O.
17
They are fast on any storage media.
18
The new ss table becomes the most recent segment of the LSM tree.
19
As more data comes in, more and more of these immutable SS tables are created and added to the LSM tree,
20
with each one representing a small chronological subset of the incoming changes.
21
Since SS tables are immutable, an update to an existing object key does not override an existing table.
22
Instead, a new entry is added to the most recent SS table, which supersedes any entries in the old SS tables for the object key.
23
Deleting an object requires special handling too, since we cannot mark anything in the SS table as deleted.
24
To perform a delete, it adds a marker called a tombstone to the most recent SS table for the object key.
25
When we encounter the tombstone on read, we know the object has been deleted.
26
And yes, it is a bit unintuitive that a delete takes up extra space.
27
To serve a read request, we first try to find the key in the mem table, then in the most recent SS table in the LSM tree,
28
then the next SS table, and so on.
29
Since an SS table is sorted, the lookup can be done efficiently.
30
The accumulation of SS tables presents two issues.
31
As the number of SSTables grows, it will take an increasingly long time to look up a key.
32
And as the SSTables accumulate, there are more and more outdated entries as keys are updated and tombstones are added.
33
These take up precious disk space.
34
To fix these issues, there is a periodic merging and compaction process running in the background
35
to merge SSTables and discard outdated or deleted values.
36
This reclaims this space and caps the number of SSTables a read has to look through.
37
Since the tables are sorted, this merging and compaction process is simple and efficient.
38
The approach is similar to the one used in the merge phase of the merge sort algorithm.
39
This, in a nutshell, is how an LSM tree provides fast writes.
40
Let's recap.
41
An LSM tree buffers incoming writes in memory.
42
When the buffer fills up, we sort and flush it to disk as an immutable SS table.
43
The number of SS tables increases as more buffers get flushed to disk.
44
This creates a problem for reads, as each read has to search through these SS tables to perform a lookup.
45
To cap the number of SS tables it has to search through for each read, the LSM tree merges the SSTables and compacts them in the background.
46
Let's look at the compaction process more closely.
47
When the SSTables are merged, they are organized into levels.
48
This is where the tree part of the LSM tree comes into the picture.
49
There are different strategies to determine when and how the SSTables are merged and compacted.
50
There are two broad strategies, size-tiered compaction and leveled compaction.
51
Size tier compaction is optimized for write throughput.
52
Level compaction is more read optimized.
53
We won't go into too much detail on how these compaction strategies work.
54
There are a few key points to remember though.
55
Compaction keeps the number of SS tables manageable.
56
The SS tables are organized into levels, with each level gets exponentially larger as SS tables from the level above emerged into it.
57
Compaction consumes a lot of I.O.
58
A mistuned compaction could starve the system and slow down both read and write.
59
Finally, let's visit some common optimizations for the LSM trees in production systems.
60
There are many optimization strategies that try to provide read performance closer to that of the B tree.
61
What we explain below are just the common ones, and they are by no means exhaustive.
62
To look up a key, it performs searches on the SS tables at every level.
63
Even though search is fast on sorted data, going through all the on-disk SS tables consumes a lot of I.O.
64
Many systems keep a summary table in memory that contains the min-max range of each disk block of every level.
65
It allows the system to skip searches on those disk blocks where the key does not fall within the range.
66
This saves a lot of random I.O.
67
Another issue that could be potentially expensive is to look up a key that does not exist.
68
This would require looking through all the eligible blocks at all the levels.
69
Most systems keep a bloom filter at each level.
70
A bloom filter is a space-efficient data structure that returns a firm no if a key does not exist, or a probably yes if a key might exist.
71
This allows the system to skip a level entirely if the key does not exist there, which dramatically reduces the number of random I.O required.
72
In conclusion, NoSQL databases backed by an LSM tree could be tuned to support a very high write rate.
73
As with any database, proper tuning is the key.
74
For an LSM tree, compaction tuning is the most critical.
75
If you would like to learn more about system design, check out our books and weekly newsletter.
76
Please subscribe if you learn something new.
77
Thank you so much and we'll see you next time.

ดาวน์โหลดแอป

ทุกอย่างที่ต้องใช้เพื่อพูดได้คล่อง

AI ให้คะแนนการออกเสียงให้คะแนนทุกประโยค
ฝึก IPAเชี่ยวชาญทุกเสียง
คำศัพท์สร้างคลังคำของคุณ
เกมคำศัพท์เล่นไปเรียนไป
สแกน QR
สแกน QR
Download on theApp StoreGet it onGoogle Play

ช่องเดียวกัน

Proxy vs Reverse Proxy (Real-world Examples)C1
3

Proxy vs Reverse Proxy (Real-world Examples)

Daily ConversationUniversity StudentsWorking Adults
Cache Systems Every Developer Should KnowC1
2

Cache Systems Every Developer Should Know

Daily ConversationUniversity StudentsWorking Adults
Top 5 Redis Use CasesC1
2

Top 5 Redis Use Cases

Daily ConversationUniversity Students
Everything You Need to Know About DNS: Crash Course System Design #4C1
3

Everything You Need to Know About DNS: Crash Course System Design #4

Daily ConversationUniversity StudentsWorking Adults
CAP Theorem SimplifiedC1
2

CAP Theorem Simplified

Daily ConversationUniversity StudentsWorking Adults
What Is REST API? Examples And How To Use It: Crash Course System Design #3C1
2

What Is REST API? Examples And How To Use It: Crash Course System Design #3

Daily ConversationUniversity StudentsWorking Adults
8 Most Important System Design Concepts You Should KnowC1
8

8 Most Important System Design Concepts You Should Know

Daily ConversationUniversity StudentsWorking Adults
System Design: Why is Kafka fast?C1
1

System Design: Why is Kafka fast?

Business EnglishUniversity StudentsWorking Adults
What Are Microservices Really All About? (And When Not To Use It)C1
6

What Are Microservices Really All About? (And When Not To Use It)

Business EnglishUniversity StudentsWorking Adults
System Design Was HARD - Until You Knew the Trade-OffsC1
3

System Design Was HARD - Until You Knew the Trade-Offs

Daily ConversationUniversity StudentsWorking Adults
How Does a URL Shortener Work?C1
3

How Does a URL Shortener Work?

Business EnglishInterview EnglishUniversity Students
System Design: Why is Kafka Popular?C1
3

System Design: Why is Kafka Popular?

Business EnglishUniversity StudentsWorking Adults
What is API Gateway?C1
4

What is API Gateway?

Business EnglishUniversity StudentsWorking Adults
10+ Key Memory & Storage Systems: Crash Course System Design #5C1
2

10+ Key Memory & Storage Systems: Crash Course System Design #5

University StudentsWorking Adults
Kubernetes Explained in 6 Minutes | k8s ArchitectureC1
50

Kubernetes Explained in 6 Minutes | k8s Architecture

Business EnglishUniversity StudentsWorking Adults
What Is Redis Really About? Why Is It So Popular?C2
4

What Is Redis Really About? Why Is It So Popular?

Business EnglishUniversity StudentsWorking Adults
How Git Works: Explained in 4 MinutesB2

How Git Works: Explained in 4 Minutes

Business EnglishUniversity StudentsWorking Adults
FOR YOU

วิดีโอแนะนำ

Sec Growth DataScience staff meeting Sep 14 2022C1
1
398 ประโยค

Sec Growth DataScience staff meeting Sep 14 2022

Daily ConversationUniversity StudentsWorking Adults
Did Anthropic Kill Git?C1
1
65 ประโยค

Did Anthropic Kill Git?

Daily ConversationUniversity StudentsWorking Adults
what is a database index?C1
3
68 ประโยค

what is a database index?

Daily ConversationUniversity StudentsWorking Adults
How do microSD Cards Store 2 TB in such a TINY space?C1
1
65 ประโยค

How do microSD Cards Store 2 TB in such a TINY space?

Daily ConversationUniversity StudentsWorking Adults
Database vs Data Warehouse vs Data Lake | Explaining the DifferencesB2
1
42 ประโยค

Database vs Data Warehouse vs Data Lake | Explaining the Differences

Daily ConversationUniversity StudentsWorking Adults
Redis Crash Course - the What, Why and How to use Redis as your primary databaseC1
231 ประโยค

Redis Crash Course - the What, Why and How to use Redis as your primary database

Daily ConversationUniversity StudentsWorking Adults
The Man Who Stole MySpace | SamyB2
1
205 ประโยค

The Man Who Stole MySpace | Samy

Daily ConversationUniversity StudentsWorking Adults
You are wasting memoryC1
1
27 ประโยค

You are wasting memory

Daily ConversationUniversity StudentsWorking Adults
SAC | Soft Actor Critic (SAC) architecture | SAC ExplainedC1
13
202 ประโยค

SAC | Soft Actor Critic (SAC) architecture | SAC Explained

Daily ConversationUniversity StudentsWorking Adults
Database Sharding! Designing Data-Intensive Applications chapter 6C1
1
689 ประโยค

Database Sharding! Designing Data-Intensive Applications chapter 6

Daily ConversationUniversity StudentsWorking Adults
LangChain in 5 Minutes (Explained Clearly)C1
1
74 ประโยค

LangChain in 5 Minutes (Explained Clearly)

Daily ConversationUniversity StudentsWorking Adults

คำศัพท์และข้อสังเกตด้านการพูดสำหรับบทเรียนนี้

บทเรียนฝึกพูดระดับ C1 นี้ใช้วิดีโอ “The Secret Sauce Behind NoSQL: LSM Tree” เป็นสื่อ คำที่ถูกพูดซ้ำบ่อยที่สุด: table, tree, key, Lsm, compaction วิดีโอนี้มี 77 ประโยค และ 1089 คำ สำหรับฝึกพูดตาม ช่วงที่มีเสียงพูดยาว 7:26 ผู้พูดพูดด้วยความเร็วสม่ำเสมอ ประมาณ 147 คำต่อนาที เหมาะกับการฝึกพูดตาม มีเพียง 72% ของคำที่อยู่ใน 3,000 คำที่ใช้บ่อยที่สุดในภาษาอังกฤษ คำศัพท์จึงค่อนข้างยาก

คำศัพท์สำคัญในวิดีโอนี้

คำที่ยากที่สุด 8 คำในวิดีโอ พร้อมคำอ่านและความหมาย:

คำศัพท์คำอ่านความหมาย
disk คำนาม/dɪsk/ดิสก์, จักร
tombstone คำนาม/ˈtuːmstoʊn/ป้ายสุสาน
consume คำกริยา/kənˈsum/อุปโภค, ใช้
accumulate คำกริยา/əˈkjuːmjʊˌleɪt/เก็บ
newsletter คำนาม/ˈn(j)uzˌlɛtɚ/จดหมายข่าว
explode คำกริยา/ɪkˈsploʊd/ระเบิด
emerge คำกริยา/ɪˈmɝd͡ʒ/ผุด
algorithm คำนาม/ˈælɡəɹɪðm̩/ขั้นตอนวิธี, อัลกอริทึม

ไวยากรณ์ในวิดีโอนี้

โครงสร้างที่ผู้พูดใช้บ่อยที่สุด พร้อมคำพูดจริงจากวิดีโอ:

โครงสร้างในวิดีโอ
Passive voice be + กริยาช่อง 3 — เน้นสิ่งที่เกิดขึ้น ไม่ใช่ผู้กระทำis optimized · is typically stored · is commonly backed
Present perfect have/has + กริยาช่อง 3 — เหตุการณ์ในอดีตที่ยังเกี่ยวข้องกับปัจจุบันhave exploded · has been deleted

การออกเสียงที่ควรระวัง

  • เสียง “th”: throughput /ˈθɹuː.pʊt/, algorithm /ˈælɡəɹɪðm̩/
  • เสียง “sh” และ “zh”: compaction /kəmˈpækʃən/, flush /ˈflʌʃ/, optimization /ˌɑptəmaɪˈzeɪʃən/, exponentially /ɛkspə(ʊ)ˈnɛnʃəli/, insatiable /ɪnˈseɪʃ(j)əbəl/
  • คำยาว — ลงเสียงหนักให้ถูกพยางค์: optimization /ˌɑptəmaɪˈzeɪʃən/, accumulate /əˈkjuːmjʊˌleɪt/, chronological /ˌkɹɑnəˈlɑd͡ʒɪkəl/, exponentially /ɛkspə(ʊ)ˈnɛnʃəli/, insatiable /ɪnˈseɪʃ(j)əbəl/

เสียงที่คนไทยมักออกเสียงยาก:

  • เสียงท้ายคำ — ออกเสียงให้ครบ ไม่เปลี่ยนเป็นตัวสะกดแบบไทย: merge /mɝd͡ʒ/, optimize /ˈɑptɪmaɪz/, flush /ˈflʌʃ/, organize /ˈɔɹɡənaɪz/, chronological /ˌkɹɑnəˈlɑd͡ʒɪkəl/
  • /v/ — ไม่ใช่ /w/ ให้ฟันบนแตะริมฝีปากล่าง: exhaustive /ɪɡˈzɔstɪv/, override /oʊ.vɚˈɹaɪd/, starve /stɑɹv/
  • /z/ — เสียงก้อง ไม่ใช่ /s/: optimize /ˈɑptɪmaɪz/, optimization /ˌɑptəmaɪˈzeɪʃən/, organize /ˈɔɹɡənaɪz/, exhaustive /ɪɡˈzɔstɪv/, newsletter /ˈn(j)uzˌlɛtɚ/

วิธีฝึกกับวิดีโอนี้

  1. ฟังวิดีโอให้จบหนึ่งรอบโดยยังไม่ต้องพูด แล้วจดคำที่ยังไม่รู้จัก
  2. พูดตามทีละประโยคด้วยความเร็วปกติ ทำซ้ำแต่ละประโยคจนจังหวะของคุณตรงกับผู้พูด
  3. อัดเสียงตัวเองแล้วเทียบกับต้นฉบับ โดยสังเกตคำอย่าง disk, tombstone, consume เป็นพิเศษ

เทคนิค Shadowing คืออะไร?

Shadowing เป็นเทคนิคการเรียนรู้ภาษาที่ได้รับการรับรองทางวิทยาศาสตร์ พัฒนาขึ้นสำหรับการฝึกนักแปลมืออาชีพ วิธีการนี้เรียบง่ายแต่ทรงพลัง: คุณฟังเสียงภาษาอังกฤษจากเจ้าของภาษาและพูดตามทันที — เหมือนเงาที่ตามผู้พูดด้วยช่วงเวลาห่าง 1-2 วินาที การวิจัยแสดงว่าเทคนิคนี้ปรับปรุงความแม่นยำในการออกเสียง ทำนองเสียง จังหวะ การเชื่อมเสียง การฟังเข้าใจ และความคล่องแคล่วในการพูดได้อย่างมีนัยสำคัญ

เทคนิค shadowing: อ่านคู่มือฉบับเต็มทีละขั้นตอน →