Xor Filters: Faster and Smaller Than Bloom Filtershttps://lemire.me/blog/2019/12/19/xor-filters-faster-and-smaller-than-bloom-filters/ …
-
This article felt like a bait-and-switch. It sounded interesting until the very end, when finding out it’s immutable-only and, as such, not an online-capable algorithm. That’s a pretty big caveat and a huge difference when basing the article on bloom and cuckoo comparisons. :(
Neither Bloom nor cuckoo filters are online algorithms. It is all fixed capacities.
-
-
False. They can, and are, used online, calculated with their trade-offs. This algorithm cannot, in any way, be used comparably in that scenario. I’m not saying this isn’t useful, but it’s only comparable to bloom and cuckoo for a single use case.
-
I give you a stream of keys, and you don’t know ahead of time how many you are going to get... that’s what I mean by online... Neither Bloom nor cuckoo filters work for this...
- Još 4 druga odgovora
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.