Practical performance of Bloom filters and parallel free-text searching
- 1 October 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 32 (10) , 1237-1239
- https://doi.org/10.1145/67933.67941
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.Keywords
This publication has 6 references indexed in Scilit:
- Parallel free-text search on the connection machine systemCommunications of the ACM, 1986
- Programming pearlsCommunications of the ACM, 1985
- A second look at bloom filtersCommunications of the ACM, 1983
- Designing a Bloom filter for differential file accessCommunications of the ACM, 1982
- Experience with a space efficient way to store a dictionaryCommunications of the ACM, 1981
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979