blooming-bella
A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms. (by younisshah)
willf/bloom
Go package implementing Bloom filters, used by Milvus and Beego. (by willf)
| blooming-bella | willf/bloom | |
|---|---|---|
| - | 2 | |
| 1 | 2,283 | |
| - | 0.9% | |
| 0.0 | 4.8 | |
| almost 7 years ago | about 2 months ago | |
| Go | Go | |
| - | BSD 2-clause "Simplified" License |
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.
blooming-bella
Posts with mentions or reviews of blooming-bella.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning blooming-bella yet.
Tracking mentions began in Dec 2020.
willf/bloom
Posts with mentions or reviews of willf/bloom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-17.
-
willf/bloom VS bloom_cpp - a user suggested alternative
2 projects | 17 Mar 2023
-
There are 87 bloom filter crates. Strategies for choosing one?
I also have a lot of sympathy for the casual user that has a bloom-filter-shaped hole in their program that all of these filters will fill, and having reduced this part of their task to a well-known solved problem, just want to plug in a random thing & move on, with the possibility of revisiting the selection later if bloomfiltering shows up in the profiler.
What are some alternatives?
When comparing blooming-bella and willf/bloom you can also consider the following projects:
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
levenshtein - Go implementation to calculate Levenshtein Distance.
count-min-log - Go implementation of Count-Min-Log
bit - Bitset data structure
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
go-geoindex - Go native library for fast point tracking and K-Nearest queries
bitset - Go package implementing bitsets
mafsa
blooming-bella vs ttlcache
willf/bloom vs levenshtein
blooming-bella vs count-min-log
willf/bloom vs bit
blooming-bella vs boomfilters
willf/bloom vs go-adaptive-radix-tree
blooming-bella vs go-adaptive-radix-tree
willf/bloom vs boomfilters
blooming-bella vs cuckoofilter
willf/bloom vs go-geoindex
blooming-bella vs bitset
willf/bloom vs mafsa