Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn Harvard CS 165
·
Module 8
Write-Optimized Storage: LSM-Trees
1
LSM-Tree Architecture: Memtables and On-Disk Levels
Describe the architecture of a Log-Structured Merge-Tree (LSM-Tree) with its memtable and multiple on-disk levels.
2
LSM-Tree: Insertions, Deletions, and Tombstones
Implement insertions and deletions (using tombstones) in an LSM-Tree.
3
Compaction Strategies: Tiered vs. Leveled
Describe and compare tiered versus leveled compaction strategies.
4
LSM-Tree Amplification Trade-offs
Analyze the write amplification, read amplification, and space amplification trade-offs in LSM-Trees.
5
LSM-Trees vs. B+ Trees: Workload Performance Comparison
Compare the performance characteristics of LSM-Trees and B+ Trees for write-heavy versus read-heavy workloads.
6
Bloom Filters in LSM-Trees for Efficient Point Lookups
Explain how Bloom filters are used in LSM-Trees to reduce I/O for point lookups of non-existent keys.
Previous module
Columnar Storage and Execution
Next module
Parallel and Distributed Databases