LSM vs B-tree
The usual rule: write-heavy wants an LSM, read-heavy wants a B-tree. Where exactly does the choice flip?
Two ways of keeping a table on disk are billed for the same work: one overwrites the page where a row lives, the other appends now and tidies up later. Three dials set the mix of reads and writes and the shape of the appending engine. Watch the winner change hands, and change hands somewhere else on each tab.
Board: Storage Engines →Three dials, three cost panels and two tables. On a narrow screen, the panels stack. Nothing here animates.
try this Drag Share of the workload that is reads across its whole range and watch the winner under Who finishes first flip.
Included with a plan
This lab is included with a plan. The first three lessons of every track are free, with their boards and videos. A plan unlocks every lesson, board, video, lab and paper for one price.
see also Bigtable: A Distributed Storage System for Structured Data and The Log-Structured Merge-Tree (LSM-Tree) in Papers.