A second look at bloom filters

  • Authors:
  • James K. Mullin

  • Affiliations:
  • Univ. of Western Ontario, London, Ont., Canada

  • Venue:
  • Communications of the ACM
  • Year:
  • 1983

Quantified Score

Hi-index 48.23

Visualization

Abstract

This note deals with a paper by Gremillion demonstrating the simulation approach to the design of a Bloom filter. It is shown that an analytical approach can yield insights into competing filter design and give expected values for the goodness-of-hash transformations not available with simulation. On the other hand, simulation gives insight into what can be expected with available hash transformation not available from an analytic approach.