An optimization problem related to Bloom filters with bit patterns
Paper i proceeding, 2018

Bloom filters are hash-based data structures for membership queries without false negatives widely used across many application domains.They also have become a central data structure in bioinformatics. In genomics applications and DNA sequencing the number of items and number of queries are frequently measured in the hundreds of billions. Consequently, issues of cache behavior and hash function overhead become a pressing issue. Blocked Bloom filters with bit patterns offer a variant that can better cope with cache misses and reduce the amount of hashing. In this work we state an optimization problem concerning the minimum false positive rate for given numbers of memory bits, stored elements, and patterns. The aim is to initiate the study of pattern designs best suited for the use in Bloom filters. We provide partial results about the structure of optimal solutions and a link to two-stage group testing.

Bloom filter

group testing



almost disjunct matrix


Peter Damaschke

Chalmers, Data- och informationsteknik, Data Science

Alexander Schliep

Göteborgs universitet

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10706 525-538
978-3-319-73116-2 (ISBN)

44th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2018
Krems an der Donau, Austria,


Informations- och kommunikationsteknik


Grundläggande vetenskaper


Datavetenskap (datalogi)



Mer information

Senast uppdaterat