bitmap VS boomfilters

Compare bitmap vs boomfilters and see what are their differences.

bitmap

Simple dense bitmap index in Go with binary operators (by kelindar)
Data structures Bitmap Bitset Index
Source Code
Suggest alternative
Edit details

boomfilters

Probabilistic data structures for processing continuous, unbounded streams. (by tylertreat)
Data structures bloom-filter Go stable-bloom-filters cuckoo-filter probabilistic-programming counting-bloom-filters scalable-bloom-filters count-min-sketch data-stream Filter
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
bitmap boomfilters
1 -
276 1,574
- -
4.3 0.0
6 months ago about 3 years 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.

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
    2 projects | /r/golang | 30 Dec 2021
    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.

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.

What are some alternatives?

When comparing bitmap and boomfilters you can also consider the following projects:

fsm - Finite State Machine for Go

ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]

go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go

hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom

bitset - Go package implementing bitsets

roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog

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.

go-geoindex - Go native library for fast point tracking and K-Nearest queries

go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.

bitmap vs fsm boomfilters vs ttlcache bitmap vs go-adaptive-radix-tree boomfilters vs hyperloglog bitmap vs bitset boomfilters vs roaring bitmap vs null boomfilters vs bitset bitmap vs trie boomfilters vs go-geoindex bitmap vs hyperloglog boomfilters vs go-datastructures