Geek code for LSM trees

This is a link to slides from my 5-minute talk at the CIDR 2019 Gong Show. The slides are a brief overview of the geek code for LSM trees. If you click on the settings icon in the slide show you can view the speaker notes which have links to blog posts that have more details. I also pasted the links below. Given time I might add to this post, but most of the content is in my past blog posts. Regardless I think there is more to be discovered about performant, efficient and manageable LSM trees.

The key points are there are more compaction algorithms to discover, we need to make it easier to describe them and compaction is a property of a level, not of the LSM tree.

Links to posts with more details:

• Describing tiered and leveled compaction
• Number of levels that minimized write amplification
• Combining tiered and leveled compaction
• Tiered vs leveled, why not both
• Name that compaction algorithm
• Original LSM paper that got this started
• Review of SlimDB with references to the first tiered compaction, Stepped Merge