When the data item is searched, the hashes are repeated, and if there is a 1 in all three locations in the Bloom string, the data item is known to be present. See hash function. THIS DEFINITION IS ...