I build 2 bloom filters b1 and b2 from two sets of value, using a single hash function h1.
Being nothing but bit arrays, i can obtain their intersection (b3) with a bitwise AND. I can also test the emptiness of b3 by verifying that the whole vector is set to zero. So far so good... Now, to decrease the probability of false positives, i want to increase the number of hash functions to two: h1 and h2 (h1 and h2 are used for adding in both b1 and b2, setting two bits per element) I can still create their intersection b3 with a bitwise AND. My question is: Is there any way to test the emptiness of b3? I don't think that's possible. Cheers B --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
