If so, then a filter with all 1 bits set should be thrown away, as
it'll never help us, and the filter should generally become more worthwhile as it contains a higher ratio of 0 bits vs 1 bits. Of course we don't have a count of how many Tuples matched each bit, so this is based on the assumption that each bit matches an equal number of Tuples. Are you saying this is not an assumption that we should make?
Sure we should check that. All I'm saying is it has nothing to do with the first problem described in the first part of the e-mail.
Okay. I was merely suggesting this method as an alternative to checking tracking and checking the usefulness of the filter during the hash probe. I assumed that tracking and checking the usefulness during the hash probe won't be free, and that it may be better if we can estimate or determine the expected usefulness of the filter before the probe stage, and throw it away before we waste cycles using it.
