Multiple ChoiceIntermediate 45s
B+tree vs LSM read/write trade-off
Which statement best captures the classic B+tree vs LSM trade-off?
Options
- 1B+tree favors write throughput and LSM favors read latency, so the two engines invert their respective strengths for a given workload
- 2Both have identical amplification characteristics, so the choice depends only on the query language and not on read or write cost
- 3B+tree typically gives lower read amplification and in-place updates; LSM gives higher write throughput with sequential writes
- 4LSM cannot support range scans at all, so a B+tree must be layered on top whenever ordered iteration over a key range is required
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.