Tag
approximate-membership
- Apr 22, 2026 Cuckoo Filters: Fingerprint Placement and the Load-Factor Ceiling How two-bucket cuckoo hashing with stored fingerprints supports deletion in less space than a counting Bloom filter, and why displacement fails near full occupancy. data structures
- Dec 29, 2025 Counting Bloom Filters and the Price of Supporting Deletion Replacing bits with small saturating counters makes removal possible, but residue, overflow, and spurious decrements each introduce a distinct failure. data structures
- Aug 25, 2025 How a Bloom Filter Trades Bits for a False-Positive Rate The bit-array layout behind Bloom filters, the derivation of the false-positive probability, and how the bits-per-key budget fixes the achievable error. data structures