(Q885373)

English

Bloom filter

hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives

Statements

Bloom filter.svg
649 × 233; 8 KB
0 references
0 references
0 references
probability p of false positives in a Bloom filter of size m with k hash functions and n insertions (English)
0 references
10010056
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit