A license-plate camera desk wants a fast test of whether a plate was already seen today without storing every plate string in a huge exact set. Which structure fits?
Select an answer to reveal the explanation.
Short Explanation
Need a quick “have we seen this plate today?” without hauling a giant exact list? A Bloom filter is the pocket-sized maybe/no gadget for membership checks. Nightly full outer joins and paper NameNode lists are not that tool.
Full Explanation
Bloom filters provide compact probabilistic set-membership tests useful for streaming and large sets when exact storage of every element is costly. License-plate “seen today” checks are a typical membership use. Nightly full outer joins, paper NameNode lists, and CAP-unavailable blocks are not Bloom-filter solutions.