英和和英

語源

Conceived by Burton Howard Bloom in 1970.

発音

名詞

Bloom filter (plural Bloom filters)

1. (computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.
   • 2008, Bryan O'Sullivan, John Goerzen, Donald Bruce Stewart, Real World Haskell: Code You Can Believe In, O'Reilly Media, →ISBN, page 581:

     A Bloom filter is a set-like data structure that is highly efficient in its use of space. It supports two operations only: insertion and membership querying.