A Bloom filter is a space-efficient probabilistic data structure that guarantees constant string exact search with allowable errors [1].
A detailed document of this project can be found at this report.
- [1] Bloom, Burton H. (1970), "Space/Time Trade-offs in Hash Coding with Allowable Errors", Communications of the ACM, 13 (7): 422โ426, CiteSeerX 10.1.1.641.9096, doi:10.1145/362686.362692