boomfilters
Probabilistic data structures for processing continuous, unbounded streams. (by tylertreat)
roaring
Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog (by RoaringBitmap)
| boomfilters | roaring | |
|---|---|---|
| - | 5 | |
| 1,592 | 2,556 | |
| - | 1.8% | |
| 0.0 | 8.8 | |
| over 3 years ago | 28 days ago | |
| Go | Go | |
| Apache License 2.0 | Apache License 2.0 |
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.
boomfilters
Posts with mentions or reviews of boomfilters.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning boomfilters yet.
Tracking mentions began in Dec 2020.
roaring
Posts with mentions or reviews of roaring.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-02-14.
-
I have some questions about defining a series of bits in Golang
For (3), and if you’re interested in checking if specific bits are set or not, take a look at https://github.com/bits-and-blooms/bitset and https://github.com/RoaringBitmap/roaring.
- Bitmasks - how and why to use?
-
Skipfilter
Each topic has a roaring bitmap. Each bit corresponds to a subscriber in the skip list. For each topic, head and tail cursors are also maintained to ensure that newly added subscriptions are always tested and deleted subscriptions are always evicted. Roaring bitmaps are compressed and discontinuous so memory usage again remains bounded as subscribers come and go.
-
Bit shifting blew my mind
Definitely take a look at a roaring bitmap. https://github.com/RoaringBitmap/roaring
-
Protocol buffers database, a Key-Value database on the wire
Roaring bitmaps + btrees are a rock solid indexing approach. Alternatively, bleve has a lot out of the box but that's introducing a new datastore, basically.
What are some alternatives?
When comparing boomfilters and roaring you can also consider the following projects:
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
skiplist - skiplist for golang
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
Bloomfilter
go-geoindex - Go native library for fast point tracking and K-Nearest queries
bitset - Go package implementing bitsets
bit - Bitset data structure
gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches
mafsa