Practical performance of Bloom filters and parallel free-text searching

M. V. Ramakrishna · Communications of the ACM · 1989

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.

Read the paper · More papers on PaperTik