4 ms·
Combine a bloom filter with opposite-of-bloom and get: a) a lossless compression data structure (no false negatives or positives) OR b) garbage (both false nega
by mooneater 11y ago
Combine a bloom filter with opposite-of-bloom and get:
a) a lossless compression data structure (no false negatives or positives) OR
b) garbage (both false negatives AND positives)
- eridius 11y agoInteresting idea. Took me a moment to figure out what the actual results would be (beyond "garbage"). But unfortunately it doesn't sound very useful. What you'd end up with is a structure that reports a tri-state value: "Yes I've definitely seen it", "No I've definitely not seen it", and "I have no idea". With the added drawback of having to know your data set size in advance to tune the bloom filter (or resetting it periodically as the article suggests, but that weakens the "No" answer to "Not since my last reset").
- fit2rule 11y agoPipe the I have no ideas back into another set of bloom/nonbloom stages, the output of that back into this one, and the network becomes a computer.