Incremental Bloom Filters

@article{Hao2008IncrementalBF,
  title={Incremental Bloom Filters},
  author={Fang Hao and Murali S. Kodialam and T. V. Lakshman},
  journal={IEEE INFOCOM 2008 - The 27th Conference on Computer Communications},
  year={2008}
}
A bloom filter is a randomized data structure for performing approximate membership queries. It is being increasingly used in networking applications ranging from security to routing in peer to peer networks. In order to meet a given false positive rate, the amount of memory required by a bloom filter is a function of the number of elements in the set. We consider the problem of minimizing the memory requirements in cases where the number of elements in the set is not known in advance but the… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS