All Questions
Data Modeling hard

Log Systems Merge (LSM) Trees (used in RocksDB, Cassandra) optimize for fast writes. What is their primary downside regarding Disk I/O?

  1. A Excessive 'Read Amplification', where the database must scan multiple disparate levels of sorted files on the disk to find the most recent version of a record.
  2. B Intense 'Write Amplification' during Compaction, as existing data is repeatedly read and rewritten during background merges to maintain a sorted structure.
  3. C Severe 'Random I/O Latency', as the append-only nature of the log requires the disk head to make frequent, unpredictable jumps across the physical storage blocks.
  4. D Massive 'Index Fragmentation', which occurs when the database's internal B-Tree structure becomes inefficient due to the high volume of non-sequential record updates.

One system design question a day, with spaced repetition so the ones you miss come back.

Get the app

Related questions