LSM Trees tackle multi-key comparison challenges in databases. This is achieved using SSTables & MemTable. SSTables partition disks into sorted segments, while MemTables manage in-memory sorting and flushing.
Bitcask is fast Key-Value store that is optimized to serve production grade throughput in sub-millisecond times. It internally implements a hash index over data stored sequentially in a log structured file system.