maokaihe/mini_lsm
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

more questions

Browse Source 
Signed-off-by: Alex Chi Z <iskyzh@gmail.com>
This commit is contained in:
Alex Chi Z
2024-01-21 14:27:29 +08:00
parent 9eb197114d
commit b67c22611d
2 changed files with 9 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
mini-lsm-book/src/week1-07-sst-optimizations.md
View File

@@ -9,6 +9,12 @@ In this chapter, you will:
* Implement bloom filter on SSTs and integrate into the LSM read path `get`.
* Implement key compression in SST block format.
## Task 1: Bloom Filters
## Task 2: Integrate Bloom Filter on the Read Path
## Task 3: Key Compression Encoding + Decoding
## Test Your Understanding
* How does the bloom filter help with the SST filtering process? What kind of information can it tell you about a key? (may not exist/may exist/must exist/must not exist)

3
mini-lsm-book/src/week2-04-leveled.md
View File

@@ -10,6 +10,9 @@ In this chapter, you will:
## Test Your Understanding
* Finding a good key split point for compaction may potentially reduce the write amplification, or it does not matter at all?
* Imagine that a user was using tiered (universal) compaction before and wants to migrate to leveled compaction. What might be the challenges of this migration? And how to do the migration?
* What if the user wants to migrate from leveled compaction to tiered compaction?
* What needs to be done if a user not using compaction at all decides to migrate to leveled compaction?
We do not provide reference answers to the questions, and feel free to discuss about them in the Discord community.