count-min-log
cuckoofilter
Our great sponsors
| count-min-log | cuckoofilter | |
|---|---|---|
| - | 1 | |
| 66 | 1,066 | |
| - | - | |
| 0.0 | 0.0 | |
| about 7 years ago | about 1 month ago | |
| Go | Go | |
| MIT License | MIT License |
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.
count-min-log
We haven't tracked posts mentioning count-min-log yet.
Tracking mentions began in Dec 2020.
cuckoofilter
-
Looking for fast, space-efficient key-lookup
- a cuckoo filter for fast lookup. This has around a 3% false positive rate. There are other implementations however that have a much lower rate. You can store the filter in the database as well in a different bucket so you don't have to rebuild the filter on startup.
What are some alternatives?
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
binpacker - A binary stream packer and unpacker
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
skiplist - skiplist for golang
bloom - Bloom filters implemented in Go.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.
gota - Gota: DataFrames and data wrangling in Go (Golang)
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.