encoding
Integer Compression Libraries for Go (by zentures)
willf/bloom
Go package implementing Bloom filters, used by Milvus and Beego. (by willf)
| encoding | willf/bloom | |
|---|---|---|
| 1 | 2 | |
| 128 | 2,287 | |
| 0.0% | 1.0% | |
| 0.0 | 4.8 | |
| over 6 years ago | about 2 months ago | |
| Go | Go | |
| Apache License 2.0 | 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.
encoding
Posts with mentions or reviews of encoding.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-02-17.
-
q_compress 0.7: still has 35% higher compression ratio than .zstd.parquet for numerical sequences, now with delta encoding and 2x faster than before
I tried q_compress out on some of the datasets you linked and got these compressed sizes:
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 encoding and willf/bloom you can also consider the following projects:
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
levenshtein - Go implementation to calculate Levenshtein Distance.
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
bit - Bitset data structure
hilbert - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
fsm - Finite State Machine for Go
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
go-geoindex - Go native library for fast point tracking and K-Nearest queries
conjungo - A small flexible merge library in go
mafsa