Scaling an LSM-Tree: Thread-Safety and the Art of Non-Blocking

Moving from a single-threaded datastore to a high-throughput, concurrent LSM-tree isn't just about adding locks—it's about protecting invariants. Learn how to implement non-blocking reads and memtable rotation to build a database that is both thread-safe and fast.