Description
Bloom filter is a space efficient, probabilistic data structure, designed to test the membership of elements to a set.
blooming-bella alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view blooming-bella alternatives based on common mentions on social networks and blogs.
-
gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more -
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures. -
golang-set
A simple generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp. -
-
-
-
-
gocache
☔️ A complete Go cache library that brings you multiple ways of managing your caches -
boomfilters
Probabilistic data structures for processing continuous, unbounded streams. -
-
hyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL -
trie
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching. -
go-geoindex
Go native library for fast point tracking and K-Nearest queries -
ttlcache
An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] -
-
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go -
levenshtein
Go implementation to calculate Levenshtein Distance. -
cuckoo-filter
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化 -
goconcurrentqueue
Go concurrent-safe, goroutine-safe, thread-safe queue -
-
-
-
ring
Package ring provides a high performance and thread safe Go implementation of a bloom filter. -
-
go-rquad
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go -
set
A simple Set data structure implementation in Go (Golang) using LinkedHashMap. -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers -
goset
Set is a useful collection but there is no built-in implementation in Go lang. -
memlog
A Kafka log inspired in-memory and append-only data structure -
hide
ID type with marshalling to/from hash to prevent sending IDs to clients. -
The context switching struggle is real
Do you think we are missing an alternative of blooming-bella or a related project?
|
Build time-series-based applications quickly and at scale.
sponsored
www.influxdata.com
|
Popular Comparisons
-
blooming-bellavsbitset
-
blooming-bellavscuckoofilter
-
blooming-bellavsboomfilters
-
blooming-bellavscount-min-log
-
blooming-bellavsencoding
|
Truly a developer’s best friend
sponsored
scoutapm.com
|
README
blooming-belle - A simple implementation of Bloom Filters
What?
Bloom filter is a space efficient, probabilistic data structure, designed to test the membership of elements to a set.
Trade-offs?
Being a space efficient data structure is it may return false positives, but always returns definite negatives.
Applications?
Testing for non-membership saves resources such as calls to a web server, checking a proxy cache. Google Chrome uses bloom filters as a check for malicious URLs.
blooming-bella
A bloom filter for integers. Uses mummur3,Super Fast Hash and marvin32 hashing algorithms
Example
bella, err := blooming_bella.NewBella(1000, 0.01)
if err != nil {
log.Fatal(err)
}
bella.Add(10)
bella.Add(121)
bella.Add(13)
bella.Add(111)
fmt.Println(bella.Test(10)) // => true
fmt.Println(bella.Test(104)) // => false
fmt.Println(bella.Test(110)) // => false
fmt.Println(bella.Test(13)) // => true
New
Added Super Fast Hashing algorithm
TODO
- [ ] Calculate "ideal" number of hash functions to use.
- [ ] Dynamically "generate" the hash functions. What does it mean to be alive?