On Thu, Jul 3, 2014 at 11:40 PM, Stephen Frost <sfr...@snowman.net> wrote:
> Tomas, > > * Tomas Vondra (t...@fuzzy.cz) wrote: > > However it's likely there are queries where this may not be the case, > > i.e. where rebuilding the hash table is not worth it. Let me know if you > > can construct such query (I wasn't). > > Thanks for working on this! I've been thinking on this for a while and > this seems like it may be a good approach. Have you considered a bloom > filter? > IIRC, last time when we tried doing bloom filters, I was short of some real world useful hash functions that we could use for building the bloom filter. If we are restarting experiments on this, I would be glad to assist. Regards, Atri
