One Hash Bloom Filters
kept by eddie
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.
One line. Many voicesSeek and you shall find
kept by eddie
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.