Why Database Indexes Use Adaptive Radix Trees

On this episode of Database Tech with Fexingo, Lucas and Luna dive into adaptive radix trees (ARTs) — a cache-friendly index structure that's quietly replacing B-trees in some of the world's most demanding databases. They start with a concrete benchmark: a 2013 paper from the Technische Universität München showed ARTs beating B-trees by over 50 percent on a 10-million-key workload while using less memory. Lucas walks through how radix trees work, why their bit-level navigation kills cache misses, and why the adaptive node sizes make them compact enough for real-world use. He explains why ARTs shine for point lookups and prefix scans — perfect for IP routing tables and in-memory databases — and where they struggle: range scans on unsorted data and write-heavy workloads. Luna brings up a trade-off: ARTs store keys in sorted order, so range queries are still fast, but they can't match B-trees on purely sequential inserts. They also touch on real implementations: Redis, Amazon's open-source radix tree, and TiDB's in-memory storage engine. By the end, you'll know exactly when an ART beats a B-tree and when it doesn't — and why database engineers are experimenting with them for AI workloads. A light but insightful episode for anyone who's ever wondered what's under the hood of their favorite database index. #AdaptiveRadixTrees #DatabaseIndexing #BTreeAlternatives #InMemoryDatabases #CacheOptimization #RadixTree #DatabasePerformance #DataStructures #TechPodcast #Technology #Engineering #ComputerScience #Redis #TiDB #Amazon #FexingoBusiness #BusinessPodcast #DatabaseTech Keep every episode free: buymeacoffee.com/fexingo