The power of 1 + for memory-efficient Bloom filters

DOI10.1080/15427951.2011.560785MaRDI QIDQ2909115zbMATH OpenOpenAlexFDO

Authors Evgeni Krimer, Mattan Erez

Publication date 29 August 2012

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.im/1318514563

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Recommendations

• Less hashing, same performance: Building a better Bloom filter
• Less Hashing, Same Performance: Building a Better Bloom Filter
• Cache-, hash-, and space-efficient bloom filters
• Improving the performance of invertible Bloom lookup tables
• Optimizing data popularity conscious Bloom filters

Cited in

(6)

• Constructing SAT filters with a quantum annealer
• Less hashing, same performance: Building a better Bloom filter
• Less Hashing, Same Performance: Building a Better Bloom Filter
• Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
• Improving the performance of invertible Bloom lookup tables
• scientific article; zbMATH DE number 6469129 (Why is no real title available?)

This page was built for publication: The power of \(1 + \alpha \) for memory-efficient Bloom filters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909115)