A second look at bloom filters
Author:
Open Access
- 1 August 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (8) , 570-571
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.Keywords
This publication has 3 references indexed in Scilit:
- Designing a Bloom filter for differential file accessCommunications of the ACM, 1982
- Key-to-address transform techniquesCommunications of the ACM, 1971
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970