Back to Videos
Learned Indexes Explained: When a Model Replaces the B-Tree
106
Retrieval & Search Research
Mixpeek Team
July 15, 2026
Summary
The index inside nearly every database is a B-tree. Learned indexes replace that structure with a model that predicts where data lives, trading guaranteed worst cases for large average-case wins in memory and speed. The video covers how they work, where they break, and why retrieval systems increasingly blend structure with learned components.
learned-indexesdatabasesb-treeindexingsystems
About this video
The index inside nearly every database is a B-tree. Learned indexes replace that structure with a model that predicts where data lives, trading guaranteed worst cases for large average-case wins in memory and speed. The video covers how they work, where they break, and why retrieval systems increasingly blend structure with learned components.