Bloom Filter
Calculate the memory required and the number of hash functions required here
Bloom filter can test with 100% confidence if the value is not present and with lower confidence if the value is present.
Efficiently count with BitMap
https://www.youtube.com/watch?v=8ZgRW0DNus4
Count Min Sketch
The algorithm is used for data which is coming as a stream and we want to have a fast processing. We will have multiple hash functions and will have a table where we store the output of the values hashes.
If we need to find the occurrence of the value we run the values through the hash, get the stored value and then take the minimum of those values.
https://link.medium.com/Tr0RDZZt2qb
No comments:
Post a Comment