Multiple ChoiceIntermediate 45s
Bloom filter pre-check
How does a Bloom filter typically help a cache penetration problem?
Options
- 1It cheaply answers 'definitely not present' so nonexistent keys are rejected before hitting cache or DB (with false positives, no false negatives)
- 2It stores the actual values themselves so that a lookup returns the key's value directly without any cache at all
- 3It guarantees exact membership so that nonexistent keys are never mistakenly allowed through the filter at all
- 4It replaces the cache entirely because membership checks alone are enough to serve all of the reads from disk safely
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.