Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c++ > #123873
| From | boltar@caprica.universe |
|---|---|
| Newsgroups | comp.lang.c++ |
| Subject | Re: A perfect generic bloom filter |
| Date | 2026-05-22 09:15 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <10up6qq$1ccgo$1@dont-email.me> (permalink) |
| References | <10ul249$89if$1@raubtier-asyl.eternal-september.org> <10umgnh$k3kl$1@dont-email.me> <10uotck$19j8e$2@raubtier-asyl.eternal-september.org> |
On Fri, 22 May 2026 08:34:01 +0200 Bonita Montero <Bonita.Montero@gmail.com> gabbled: >Am 21.05.2026 um 10:45 schrieb boltar@caprica.universe: > >> Had to google wtf a bloom filter is. Seems like a remarkably complicated >> way to partially replace a hash lookup. > >But bloom filter occupy much less memory. And checking for a true >negative, which is the case that mostly applies when using Bloom >filters, is much more efficient since if the false positive rate >is chosen properly you check only a single bit for that in most >cases. >And I think a hash set is much more complicated. Really? I think most competant programmers could write a hash table in a few hours, albeit perhaps a not very efficient one. I doubt many - and I include myself - could write this filter without constantly refering to the spec. Also I suspect the use cases of something that doesn't give a definitive yes or no is very limited.
Back to comp.lang.c++ | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-20 21:30 +0200
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-21 09:46 +0200
Re: A perfect generic bloom filter boltar@caprica.universe - 2026-05-21 08:45 +0000
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-22 08:34 +0200
Re: A perfect generic bloom filter boltar@caprica.universe - 2026-05-22 09:15 +0000
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-22 11:34 +0200
Re: A perfect generic bloom filter red floyd <no.spam.here@its.invalid> - 2026-05-22 16:11 -0700
Re: A perfect generic bloom filter boltar@caprica.universe - 2026-05-23 08:51 +0000
Re: A perfect generic bloom filter "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-05-24 03:15 -0700
Re: A perfect generic bloom filter Bonita Montero <Bonita.Montero@gmail.com> - 2026-05-24 18:35 +0200
csiph-web