Bloom filter (Q885373)
Jump to navigation
Jump to search
hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bloom filter |
hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives |
Statements
![{\displaystyle p=\left(1-\left[1-{\frac {1}{m}}\right]^{kn}\right)^{k}\approx \left(1-e^{-kn/m}\right)^{k}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/53928f915ff68fb6ce5ac4d7a9adf203ac51b25e)
probability p of false positives in a Bloom filter of size m with k hash functions and n insertions (English)
1 reference
10010056
0 references
Identifiers
1 reference
Sitelinks
Wikipedia(20 entries)
- arwiki مرشح بلوم
- cswiki Bloomův filtr
- dewiki Bloomfilter
- enwiki Bloom filter
- eswiki Filtro de Bloom
- fawiki فیلتر بولوم
- frwiki Filtre de Bloom
- hewiki מסנן בלום
- huwiki Bloom-szűrő
- jawiki ブルームフィルタ
- kowiki 블룸 필터
- plwiki Filtr Blooma
- ruwiki Фильтр Блума
- simplewiki Bloom filter
- skwiki Bloomov filter
- srwiki Блумов филтар
- thwiki ตัวกรองของบลูม
- ukwiki Фільтр Блума
- viwiki Bộ lọc Bloom
- zhwiki 布隆过滤器
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki Category:Bloom filter