11 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.DS2023
Time-limited Bloom Filter
Ana Rodrigues, Ariel Shtul, Carlos Baquero +1
A Bloom Filter is a probabilistic data structure designed to check, rapidly and memory-efficiently, whether an element is present in a set. It has been vastly used in various compu…
cs.DS2020★ 11 cited
A Case for Partitioned Bloom Filters
Paulo Sérgio Almeida
In a partitioned Bloom Filter the bit vector is split into disjoint sized parts, one per hash function. Contrary to hardware designs, where they prevail, software imp…
cs.DS2020★ 2 cited
Age-Partitioned Bloom Filters
Ariel Shtul, Carlos Baquero, Paulo Sérgio Almeida
Bloom filters (BF) are widely used for approximate membership queries over a set of elements. BF variants allow removals, sets of unbounded size or querying a sliding window over a…