Bloom filter technique of hashing finds several applications, such as in efficient maintenance of differential files, space efficient storage of dictionaries, and parallel free-text searching. The performance of hash transformations with reference to the filter error rate is the focus of this article.
No takes yet. Share an insight, caveat, or question.
M. Ramakrishna (1989) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: