Скачать или смотреть Buzzword-Trees

Imagine a database index that never needs a lock, even with thousands of threads writing to it simultaneously. No latches, no deadlocks, just pure performance. 🚀

In this episode of "algorush", we are exploring the Bw-Tree (Buzzword-Tree)—a sophisticated, latch-free data structure originally developed by Microsoft Research for high-performance, many-core environments. If you want to see how modern databases solve the massive write-amplification and concurrency bottlenecks of traditional B-Trees, this deep dive is for you.

In this video, we break down the three architectural pillars of the Bw-Tree:

The Power of Delta Chains: Instead of updating a node in-place, the Bw-Tree prepends "delta nodes" (modifications) to a base node. We explore how it uses Compare-and-Swap (CAS) operations to achieve true latch-free concurrency.

The Mapping Table: The "secret sauce" of the Bw-Tree. We look at how an in-memory indirection layer translates logical IDs to physical addresses, allowing the database to move or consolidate pages without ever needing to update parent pointers.

Background Maintenance & Epochs: Delta chains can't grow forever. We dive into the consolidation process (merging deltas back into a base node) and Epoch-based Garbage Collection, which ensures memory is reclaimed safely without interfering with active threads.

Whether you are a Backend Architect, a Systems Engineer, or someone obsessed with high-concurrency data structures, the Bw-Tree represents a masterclass in modern hardware-conscious design.

#DatabaseInternals #BwTree #LatchFree #Concurrency #SystemDesign #BackendEngineering #MicrosoftResearch #SoftwareArchitecture #ComputerScience #DataStructures #Coding #Algorush #HighPerformance #MultiThreading #LockFree