scienceMar 8, 202511:17pending

To Be or Not To Be? B-trees with Optimistic Lock Coupling — A CedarDB Deep Dive

About this episode

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.

Get every episode summarized

Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.

Email me new episodes

Free for 3 shows. No card needed.

Hosts & guests

MMike BreaultHost

No transcript yet

This episode has not been transcribed. Request it and it moves to the front of the queue.

More episodes

To Be or Not To Be? B-trees with Optimistic Lock Coupling — A CedarDB Deep Dive

About this episode

Get every episode summarized

Hosts & guests

More from Intellectually Curious

Did OpenAI Solve Navier-Stokes? A Future-Shaping Claim Put to the Test

Understanding the Hubble Tension

OpenClaw 2.0 Feature Overview

First to Leave, Last to Arrive: The $15 Million Fermi Explorer to Alpha Centauri