By egregory
via architects.dzone.com
Published: Jan 29 2013 / 10:57
A Bloom Filter is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set. It is based on a probabilistic mechanism where false positive retrieval results are possible, but false negatives are not.
Add your comment