Reading up on data-structures
1 deep · digging since oct 23
- One Hash Bloom Filters
The article describes a Bloom filter variant that uses a single hash function combined with a deterministic permutation to achieve equivalent false positive rates with less computation.