Sign up to save your podcasts
Or
Share To Be or Not To Be? B-trees with Optimistic Lock Coupling — A CedarDB Deep Dive
Share to email
Share to Facebook
Share to X
Share to email
Share to Facebook
Share to X
Or
To Be or Not To Be? B-trees with Optimistic Lock Coupling — A CedarDB Deep Dive
Join us as we unpack why B-trees remain a database workhorse: their cache-efficient, cache-oblivious design; fine-grained lock coupling for concurrency; optimistic locking with per-node sequence numbers; and how a 70GB ClickBench index showcases scale. We’ll compare these techniques to other data structures and explore the trade-offs that keep B-trees at the core of modern databases.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
View all episodes
By Mike BreaultJoin us as we unpack why B-trees remain a database workhorse: their cache-efficient, cache-oblivious design; fine-grained lock coupling for concurrency; optimistic locking with per-node sequence numbers; and how a 70GB ClickBench index showcases scale. We’ll compare these techniques to other data structures and explore the trade-offs that keep B-trees at the core of modern databases.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC