bitmap
Simple dense bitmap index in Go with binary operators (by kelindar)
roaring
Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog (by RoaringBitmap)
Our great sponsors
bitmap | roaring | |
---|---|---|
1 | 5 | |
276 | 2,349 | |
- | 1.8% | |
4.3 | 7.6 | |
6 months ago | 11 days ago | |
Assembly | Go | |
MIT License | 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.
bitmap
Posts with mentions or reviews of bitmap.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-30.
-
Example of Entity Component System in Go
Good question, I think there's many different lessons. To your point about bitmasks, you can imagine that each component (i.e. column) has an array of data and a large bitmap that identifies whether a component is present or not. Had to build a SIMD implementation so you can do and, and not, or and xor operations on millions of components within reasonable amount of time. Interestingly enough, you still need a hashmap or b+tree in case you want to retrieve a component by it's ID instead of an index, but the rest of things can be modeled with bitmap indexes.
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 bitmap and roaring you can also consider the following projects:
fsm - Finite State Machine for Go
skiplist - skiplist for golang
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
boomfilters - Probabilistic data structures for processing continuous, unbounded streams.
bitset - Go package implementing bitsets
bit - Bitset data structure
null - Nullable Go types that can be marshalled/unmarshalled to/from JSON.
trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.