ring
Package ring provides a high performance and thread safe Go implementation of a bloom filter. (by tannerryan)
willf/bloom
Go package implementing Bloom filters, used by Milvus and Beego. (by willf)
| ring | willf/bloom | |
|---|---|---|
| - | 2 | |
| 137 | 2,287 | |
| - | 1.0% | |
| 0.0 | 4.8 | |
| over 3 years ago | about 2 months ago | |
| Go | Go | |
| BSD 2-clause "Simplified" License | 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.
ring
Posts with mentions or reviews of ring.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning ring 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 ring and willf/bloom you can also consider the following projects:
go-geoindex - Go native library for fast point tracking and K-Nearest queries
levenshtein - Go implementation to calculate Levenshtein Distance.
gota - Gota: DataFrames and data wrangling in Go (Golang)
bit - Bitset data structure
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
bitset - Go package implementing bitsets
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
fsm - Finite State Machine for Go
mafsa