Less hashing, same performance: Building a better Bloom filter (Q3522836)

From MaRDI portal
Revision as of 23:50, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Less hashing, same performance: Building a better Bloom filter
scientific article

    Statements

    Less hashing, same performance: Building a better Bloom filter (English)
    0 references
    0 references
    0 references
    4 September 2008
    0 references
    bloom filters
    0 references
    double hashing
    0 references
    Poisson convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references