Application and Research on Weighted Bloom Filter and Bloom Filter in Web Cache

A bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters and their generalizations, weighted bloom filters and compressed bloom filters have been suggested as a means for sharing Web cache information. In this paper, a summary about the current research and application on bloom filter is first given, and then a comparison of theory and practice between the bloom filter and weighted bloom filter is given. In theory, it was proved that weighted bloom filter has lower false prediction than bloom filter. But the simulation results showed that bloom filter is better than weighted. the reason is that weighted bloom filter needs the necessary conditions, which cannot be satisfied in real world.