Day: October 15, 2013

Here are some notes after listening to a coursera lecture of Algorithm 1 by Professor Roughgarden at Stanford. The goal of a Bloom filter is to provide a space efficient hash for some data entries. The insertion and validation of an entry are very efficient. But a trade-off is that deletion is not possible and…