roaring
roaring copied to clipboard
Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
Some users have a many bitmaps on disk. Loading them up temporarily for operations is expensive due in part to the allocation of new instances in this process... ```Go newrb:=...
See blog post [Faster sorted array unions by reducing branches](https://lemire.me/blog/2021/07/14/faster-sorted-array-unions-by-reducing-branches/) Related to PR https://github.com/RoaringBitmap/roaring/pull/301 credit @puzpuzpuz
This PR would remove most bound checks in the setunion code. Sadly it seems to make no difference to the performance. Marking it as a draft in case someone can...
The current implementation does a lot of allocations so it'd be beneficial to allow pooling of bitmaps. This'd amortise the cost of allocations for long running applications. Something like: ```...
This is a second attempt at fixing https://github.com/RoaringBitmap/roaring/issues/215 It is based on a previous PR by @alldroll. The changes are as follows: - [X] The benchmark, though still unrealistic, is...
would like to know 1. size and size of the bitmap in exported bytes 2. performance of the bitmap with statistics / benchmark 3. use case scenario , preferably for...
It seems that the current ParAnd implementation has O(N log(B)) complexity where N is the number of containers and B is the number of bitmaps. It should be possible to...
See https://github.com/RoaringBitmap/CRoaring/issues/99
Assuming any data is valid if loaded by ReadFrom , calling RunOptimize() should be safe. but for example in this case : ```go package main import ( "encoding/base64" "log" "github.com/RoaringBitmap/roaring"...
This incomplete PR outlined potential performance gains when replacing interface/reference containers with value-based containers. The performance difference would be particularly notable for users creating many small bitmaps. This would require...