Practical Performance of Bloom Filters and Parallel Free-Text Searching

Abstract

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. © 1989, ACM. All rights reserved.