Comment on Bloom filters: real-world applications

<- View Parent
Reader9@programming.dev ⁨1⁩ ⁨year⁩ ago

This data structure uses a 2-dimensional array to store data, documented in this scala implementation: github.com/twitter/…/CountMinSketch.scala. I’m still trying to understand it as well.

Similar to your idea, I had thought that by using k bloom filters, each with their own hash function and bit array, one could store an approximate count up to k for each key, which also might be wasteful or a naïve solution.

source
Sort:hotnewtop