The perfect structure for merging data quickly (the priority queue)
Ben Dicken · 9:19 · Watch on YouTube
An LSM engine merges already-sorted on-disk chunks by walking each chunk with a cursor and always emitting the smallest key from a priority queue, and this walkthrough shows that process on two tree chunks, including...