LSM range scan after deletes
You run an LSM-based wide-column store (Cassandra/HBase style) and a high-delete, range-scan workload is misbehaving: a partition that holds a queue (rows inserted then deleted as they're processed) is getting slower and slower to scan even though it's logically near-empty. Design how the storage engine should handle deletes and range reads so this doesn't happen, and explain the underlying mechanics. Assume sustained writes plus deletes and frequent range scans over recently-touched partitions.
What a strong answer looks like
Clarify scale and constraints first. Propose a clean component breakdown, then go deep on the hard parts (data model, bottlenecks, consistency, failure modes) and name the trade-offs you are making.
Clarify4:30 left
Estimate4:30 planned
Design13:30 planned
Deep dive10:30 planned
Failure7:00 planned
Which questions mattered is sealed until you submit. Telling you now would just be handing over the edge cases.
Run or narrate your approach, then ask the coach.