xor_singleheader
Header-only binary fuse and xor filter library (by FastFilter)
fastfilter_cpp
Fast Approximate Membership Filters (C++) (by FastFilter)
| xor_singleheader | fastfilter_cpp | |
|---|---|---|
| 2 | 2 | |
| 329 | 244 | |
| 4.0% | 1.6% | |
| 6.1 | 5.5 | |
| 3 months ago | 4 months ago | |
| C | C++ | |
| Apache License 2.0 | Apache License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
xor_singleheader
Posts with mentions or reviews of xor_singleheader.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-08-18.
- A fast alternative to the modulo reduction
-
Bloom Filters – Much, much more than a space efficient hashmap
Yes. Some variants of ribbon filters are very fast, and other variants (which are a bit slower thought) need very little space: only a few percent more than the theoretical lower bound.
For static sets, ribbon filters and binary fuse filters (e.g. here: https://github.com/FastFilter/xor_singleheader) are very competitive. Both are based on recent (2019 and newer) theoretical work from Stefan Walzer, e.g. this one https://arxiv.org/pdf/1907.04749.pdf
fastfilter_cpp
Posts with mentions or reviews of fastfilter_cpp.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-08-11.
-
Bloom Filters – Much, much more than a space efficient hashmap
Yes exactly. Actually you just need one 64-bit hash to generate all the hashes needed by the Bloom filter. So it's just N additions. And the somewhat slow modulo operation can be replaced with multiply+shift (fastRange). See e.g. https://github.com/FastFilter/fastfilter_cpp/blob/master/src...
for (int i = 0; i < k; i++) {
What are some alternatives?
When comparing xor_singleheader and fastfilter_cpp you can also consider the following projects:
awesome-ethereum-rollups - A list of resources related to scaling with rollups.
fastfilter_java - Fast Approximate Membership Filters (Java)
Golomb-coded-map - A space-efficient, associative alternative to the Bloom filter