Less hashing, same performance: Building a better Bloom filter (Q3522836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5320784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Less hashing, same performance: Building a better Bloom filter |
scientific article; zbMATH DE number 5320784 |
Statements
Less hashing, same performance: Building a better Bloom filter (English)
0 references
4 September 2008
0 references
bloom filters
0 references
double hashing
0 references
Poisson convergence
0 references
0.998621940612793
0 references
0.8156164288520813
0 references
0.8054624795913696
0 references
0.7940254807472229
0 references
0.7894273996353149
0 references
