Practical Performance of Bloom Filters and Parallel Free-Text Searching
Author
M. V. Ramakrishna
Entry type
article
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.
Date
1989 – October
Editor
Edgar H. Sibley
Journal
Communications of the ACM
Key alpha
Ramakrishna
Number
10
Pages
1237-1239
Volume
32
Publication Date
0000-00-00
Location
A hard-copy of this is in the Papers Cabinet

