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.
- Još 6 drugih odgovora
Novi razgovor -
-
-
Any comparison to vacuum filter (vldb19?)
-
Xor filters are going to be faster, smaller; the implementation far simpler (~200 lines).
Kraj razgovora
Novi razgovor -
-
-
CF nerd here, thanks for the paper I'll make sure to read it carefully. In the meantime, two nitpicks: 1. Cuckoo's aren't that hard, I have a <250 LOC implementation that doesn't cut corners.https://github.com/kristoff-it/zig-cuckoofilter …
-
Your implementation is great and quite simple. I don't think I ever wrote that this wasn't possible. I will write however that your implementation of an xor filter would be simpler. At least the query part...
- Još 1 odgovor
Novi razgovor -
-
-
Nice implementation! The space savings are impressive. Have you considered comparing against cache-sectorized and register-blocked Bloom filters? http://www.vldb.org/pvldb/vol12/p502-lang.pdf …https://github.com/peterboncz/bloomfilter-bsd …
-
This repo contains reproducibility instructions:https://github.com/peterboncz/bloomfilter-repro …
- Još 1 odgovor
Novi razgovor -
-
-
When I experimented with random acyclic graphs, murmur was quite bad on some inputs, look at how many tests are commented out: https://github.com/alnsn/rgph/blob/a3b5821d43821a9d9cb4d042a356a48e4bc35885/test/graph.lua#L339 …
-
Murmur is quite good. Are you sure that your implementation is correct?
- Još 1 odgovor
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.
