Bloom Filter Advancements

Abstract

This project deals with the Bloom filter advancements where a basic bloom filter is designed. The main idea of designing a bloom filter is to reduce the time complexity of search by keeping the false positive probability as minimum as possible. The drawbacks of the basic bloom filter is seen which are further dealt with in the next level of Bloom filters which is counting bloom filters. At each level, the false positive probability is reduced. Another advancement is done by creating weighted bloom filter which is an advanced version of the basic bloom filter with further reduced false positivity rate. Hence the comparison between these three filters is done and evaluated. The matlab implementation of the filters are done to see which filter is best in terms or reduced search time as well lower false positive rate. Also the complexity analysis is added to see how the time and space complexity increase or decrease with the advancements.