
25 Jun
2011
25 Jun
'11
7:19 a.m.
Phil Endecott wrote:
For some reason I have a mental block about how intersection works. Union is OK; I can see that
set a; set b; bloom_filter(a) union bloom_filter(b) == bloom_filter( a union b );
but it's not clear to me if
bloom_filter(a) intersect bloom_filter(b) == bloom_filter( a intersect b );
Can you convince me?
That is correct, afaik only union (or) and difference (xor) can be applied to non-counting BFs.