Research and application on bloom filter

Abstract

A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries and has a false prediction. 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 will first be given, and then Bloom filter was tested via simulation. The simulation results showed that Bloom filter is useful for space savings and it is easy to implement. The results also showed that the optimal number of hash function minimizes the false prediction. © 2009 Springer Berlin Heidelberg.