BLOOM FILTERS & THEIR APPLICATIONS

@inproceedings{Pal2012BLOOMF,
  title={BLOOM FILTERS & THEIR APPLICATIONS},
  author={Saibal K. Pal and Puneet Sardana},
  year={2012}
}
A Bloom Filter (BF) is a data structure suitable for performing set membership queries very efficiently. A Standard Bloom Filter representing a set of n elements is generated by an array of m bits and uses k independent hash functions. Bloom Filters have some attractive properties including low storage requirement, fast membership checking and no false negatives. False positives are possible but their probability may be controlled and significantly lowered depending upon the application… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Towards Stateless Single-Packet IP Traceback

32nd IEEE Conference on Local Computer Networks (LCN 2007) • 2007
View 1 Excerpt

Hash-AV: fast virus signature scanning by cache-resident filters

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005. • 2005
View 1 Excerpt