Data Structures

Bloom FiltersDesign and Analysis

of Algorithms I

Tim Roughgarden

Bloom Filters: Supported Operations

Tim Roughgarden

Bloom Filters: Applications

Tim Roughgarden

Bloom Filter: Under the Hood

Tim Roughgarden

Heuristic Analysis

(1− 1𝑛 )𝑘∨𝑆∨¿¿

1−(1− 1𝑛 )𝑘∨𝑆∨¿ ¿

(1𝑛 )

¿𝑆∨¿ ¿

(1− 1𝑛 )¿𝑆∨¿ ¿

Under the heuristic assumption, what is the probability that a given bit of the bloom filter (the first bit, say) has been set to 1 after the data set S has been inserted?

Tim Roughgarden

Heuristic Analysis

Tim Roughgarden

Heuristic Analysis (con’d)