Cache-, hash-, and space-efficient bloom filters

DOI10.1145/1498698.1594230zbMath1284.68218OpenAlexW2125763460MaRDI QIDQ5406220

Peter Sanders, Johannes Singler, Felix Putze

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1498698.1594230

zbMATH Keywords

data compressionapproximate dictionary

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Bloom Filters in Adversarial Environments ⋮ Xor Filters

This page was built for publication: Cache-, hash-, and space-efficient bloom filters