Last Minute Notes
Github
Docs
Learn
Search
⌘
K
@sayanstwt
Lessons
Learn
/
System Design
/
Data & Storage
Indexes & Storage Engines
8 min
Intermediate
8 steps
B-trees for reads, LSM trees for writes, and what each costs.
Query
id = 34
Rows read
1
Cost
O(n)
id 17
row 0
id 42
row 1
id 8
row 2
id 63
row 3
id 25
row 4
id 34
row 5
id 91
row 6
id 56
row 7
scan
current
visited
done
In this lesson
Step 1 of 8
1
The problem
2
B-tree
3
Range
4
Composite
5
Covering
6
Write cost
7
LSM tree
8
Recap