Prev: Review: Patch: Allow substring/replace() to get/set bit values
Next: Synchronization primitives (Was: Re: [HACKERS] An example of bugsfor Hot Standby)
From: pg on 20 Jan 2010 09:48
> Then your union operation is to just bitwise or the two bloomfilters.

Keep in mind that when performing this sort of union between two comparably-sized sets, your false-positive rate will increase by about an order of magnitude. You need to size your bloom filters accordingly, or perform the union differently. Intersections, however, behave well.

There is a similar problem, among others, with expanding smaller filters to match larger ones.

David Hudson



 | 
Pages: 1
Prev: Review: Patch: Allow substring/replace() to get/set bit values
Next: Synchronization primitives (Was: Re: [HACKERS] An example of bugsfor Hot Standby)