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 has transformations with reference
to the filter error rate is the focus of this article.