Google SWE teaches systems design | EP41: Bloom Filters for set approximation

preview_player
Показать описание
Bloom filters told me she cut me from the roster smh

Recommended Reading:
Рекомендации по теме
Комментарии
Автор

Great content without begging for subs, likes. Thumbs up.

petriq
Автор

Hey man. Loving these videos. Inspired to study this stuff in a similar way. Any tips you have for doing so? Or maybe a better question is, what further resources would you recommend other than watching your videos? :)

tchwood
Автор

Hey Jordan, great video. I had a question about the bloom filter algorithm. You said that we use 'm' bits and 'k' hash functions. How exactly do we choose values for 'k' and 'm'? Is it based on some relationship to the expected length of the key?

tarunnurat