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

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.

Popout Listen on the new Podbay
Loading...