Linear Digressions

The Case for Learned Index Structures, Part 2: Hash Maps and Bloom Filters

Linear Digressions

Last week we started the story of how you could use a machine learning model in place of a data structure, and this week we wrap up with an exploration of Bloom Filters and Hash Maps. Just like last week, when we covered B-trees, we'll walk through both the "classic" implementation of these data structures and how a machine learning model could create the same functionality.

Next Episodes



Linear Digressions

The Fourier Transform @ Linear Digressions

📆 2018-01-08 03:07 / 00:15:39


Linear Digressions

Statistics of Beer @ Linear Digressions

📆 2018-01-02 02:57 / 00:15:20


Linear Digressions

Re - Release: Random Kanye @ Linear Digressions

📆 2017-12-24 20:07 / 00:09:33