Bloom filter
hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives
Facts
11 properties- Instance of
- Approximate Membership Query Filter
- Publication date
- July 1, 1970[5]
- ACM Classification Code (2012)
- 10010056[8]
- Defining formula
- p=\left(1-\left[1-{\frac {1}{m}}\right]^{kn}\right)^{k}\approx \left(1-e^{-kn/m}\right)^{k}
- Discoverer or inventor
- Burton Howard Bloom[2]
- Does not have effect
- type II error[11]
- Has effect
- type I error[6]
- Named after
- Burton Howard Bloom[3]
🏷️ Also known as
en Bloom filter
ar فلتر بلوم
ar مرشح بلوم
cs Bloomův filtr
de Bloom-filter
de Bloomfilter
de Bloom-Filter
es filtro de Bloom
fa فیلتر بولوم
fr filtre de Bloom
fr Filtre de bloom
fr Filtre De Bloom
he בלום פילטר
he Bloom filter
he מסנן בלום
hu Bloom-szűrő
ja ブルームフィルタ
ko 블룸 필터
pl filtr Blooma
ru Bloom filter
🔖 Identifiers · 8
- OpenAlex ID
- C147224247
- Dictionary of Algorithms and Data Structures ID
- bloomFilter
- Encyclopedia of China (Third Edition) ID (2026)
- 3NyiMa
- Encyclopedia of China (Third Edition) old ID (2021)
- 46870
- Freebase ID
- /m/02vfzg
- Microsoft Academic ID (discontinued)
- 147224247
- Quora topic ID
- Bloomfilter
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Different from 1
Discoverer or inventor 1
Does not have effect 1
Has effect 1
Maintained by WikiProject 1
Named after 1
Press Enter · cited answer in seconds
0 sources
Summary
Bloom filter is an Approximate Membership Query Filter[1].