Hacker GitHub

← All repos

FastFilter/fastfilter_java

View on GitHub ↗ ★ 261 Java

Fast Approximate Membership Filters (Java)

7 mentions on Hacker News by 2 people: 0 stories, 7 comments · first 2019-12-20 · latest 2026-02-22

Mentions per year 7 mentions · busiest year 2026 (4)
20082026
  1. …[2] https://github.com/FastFilter/fastfilter_cpp/blob/master/src... [3] https://github.com/FastFilter/fastfilter_java/blob/master/fa... [4] https://github.com/FastFilter/fastfilter_cpp/blob/master/src...
  2. …version fairly well), I'm not sure it could be made much faster than that either. Edit: I see https://github.com/FastFilter/fastfilter_java/blob/master/fa... tries to make that operation in O(1), but to be honest, with this many…
  3. FWIW, I found https://github.com/FastFilter/fastfilter_java/issues/28 a pretty good explanation of what's going on in the succinct counting blocked Bloom filters. (I'm not sure if the blocking is needed for the normal Bloom filter part,…
  4. …(cardinality estimation). This project also includes 64-bit approximate counts and histograms. [1] https://github.com/FastFilter/fastfilter_java/blob/master/fa... [2] https://github.com/thomasmueller/tinyStats
  5. …far, there are only two Java implementations. One is using "Rank" and the other is using "Select": https://github.com/FastFilter/fastfilter_java/blob/master/fa... https://github.com/FastFilter/fastfilter_java/blob/master/fa... It should be…
  6. …https://github.com/FastFilter/fastfilter_cpp (this is based on the cuckoo filter benchmark) and https://github.com/FastFilter/fastfilter_java For static sets (where you construct the filter once and then use it for lookup), blocked Bloom…
  7. …the size overhead in any way. Maybe you can help? There are two implementations, one is Java: https://github.com/FastFilter/fastfilter_java/blob/master/sr... and the other is C++: https://github.com/FastFilter/fastfilter_cpp/blob/master/src…