All challenges
Multiple ChoiceHard 45s

Tombstone accumulation in LSM

Deletes in an LSM store write tombstones. What operational problem arises if compaction never reaches the oldest level?
Options
  1. 1Reads get faster because tombstones are sparse, so scans skip deleted ranges and return live rows without extra work
  2. 2Tombstones accumulate, inflating disk usage and slowing reads due to scanning many delete markers
  3. 3The database automatically switches to a B+tree once tombstones accumulate, so reads no longer scan delete markers
  4. 4Writes fail immediately with an overflow error once too many tombstones exist, forcing a compaction before inserts

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.

Play this in a 3-minute battle