Displaying 1 to 20 from 26 results

RoaringBitmap - A better compressed bitset in Java

  •    Java

Roaring bitmaps are compressed bitmaps (also called bitsets) which tend to outperform conventional compressed bitmaps such as WAH or Concise.

EWAHBoolArray - A compressed bitmap class in C++.

  •    C++

The class EWAHBoolArray is a compressed bitset data structure. It supports several word sizes by a template parameter (16-bit, 32-bit, 64-bit). You should expect the 64-bit word-size to provide better performance, but higher memory usage, while a 32-bit word-size might compress a bit better, at the expense of some performance.The library also provides a basic BoolArray class which can serve as a traditional bitmap.




javaewah - A compressed alternative to the Java BitSet class

  •    Java

The bit array data structure is implemented in Java as the BitSet class. Unfortunately, this fails to scale without compression. JavaEWAH is a word-aligned compressed variant of the Java bitset class. It uses a 64-bit run-length encoding (RLE) compression scheme. The goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, we try to save CPU cycles, maybe at the expense of storage. However, the EWAH scheme we implemented is always more efficient storage-wise than an uncompressed bitmap (implemented in Java as the BitSet class). Unlike some alternatives, javaewah does not rely on a patented scheme.

roaring - Roaring bitmaps in Go (golang)

  •    Go

This is a go port of the Roaring bitmap data structure.Roaring bitmaps are used by several major systems such as Apache Lucene and derivative systems such as Solr and Elasticsearch, Metamarkets' Druid, LinkedIn Pinot, Netflix Atlas, Apache Spark, OpenSearchServer, Cloud Torrent, Whoosh, Pilosa, Microsoft Visual Studio Team Services (VSTS), and eBay's Apache Kylin.

bitset - Go package implementing bitsets

  •    Go

Package bitset implements bitsets, a mapping between non-negative integers and boolean values. It should be more efficient than map[uint] bool.It provides methods for setting, clearing, flipping, and testing individual integers.

cbitset - A simple bitset library in C

  •    C

Simple bitset library in C. It includes fast functions to compute cardinalities, unions, intersections...


csharpewah - Compressed bitmaps in C#

  •    CSharp

This is a compressed variant of the standard bitarray class. It uses a 64-bit RLE-like compression scheme. It can be used to implement bitmap indexes.The goal of word-aligned compression is not to achieve the best compression, but rather to improve query processing time. Hence, we try to save CPU cycles, maybe at the expense of storage. However, the EWAH scheme we implemented is always more efficient storage-wise than an uncompressed bitarray.

sparsebitmap - A simple sparse bitmap implementation in java

  •    Java

Alternative compressed bitmap implementations in Java such as JavaEWAH can be a bit overengineered. The goal of this project is to come up with a very simple alternative that has good performance.

SwiftBitset - A fast Bitset class in Swift

  •    Swift

A bitset class in Swift for fast and concise set operations over integers. Works under both Linux and MacOS. It is engineered to be really fast, on par with portable C/C++ implementations.To dissamble a function...

CRoaring - Roaring bitmaps in C (and C++)

  •    C

Bitsets, also called bitmaps, are commonly used as fast data structures. Unfortunately, they can use too much memory. To compensate, we often use compressed bitmaps.Roaring bitmaps are compressed bitmaps which tend to outperform conventional compressed bitmaps such as WAH, EWAH or Concise. They are used by several major systems such as Apache Lucene and derivative systems such as Solr and Elasticsearch, Metamarkets' Druid, LinkedIn Pinot, Netflix Atlas, Apache Spark, OpenSearchServer, Cloud Torrent, Whoosh, Pilosa, Microsoft Visual Studio Team Services (VSTS), and eBay's Apache Kylin.

croaring-rs - Rust wrapper for CRoaring

  •    Rust

Tested on Rust stable/beta/nightly and LLVM version 3.8.

PyRoaringBitMap - A Python wrapper over the C implementation of roaring bitmap.

  •    Python

An efficient and light-weight ordered set of 32 bits integers. This is a Python wrapper for the C library CRoaring.If for some reason you wish to keep using the old version, based on Ctypes, use PyRoaring 0.0.7.

bit-array - JavaScript implementation of bit arrays.

  •    Javascript

Even though bit arrays are not that useful in JavaScript, there is one place where they excel; encoding large boolean sets for transfer between the browser and server. A JSON representation of a bit array is much smaller than an actual boolean array. Alternatively you could just include bit-array.js in your project.

BitSet.js - An arbitrary size Bit-Vector implementation in JavaScript

  •    Javascript

BitSet.js is a infinite Bit-Array implementation in JavaScript. That means that if you invert a bit vector, the leading ones get remembered. As far as I can tell, BitSet.js is the only library which has this feature. It is also heavily benchmarked against other implementations and is the fastest implementation to date.NOTE: As of version v4.0.0, BitSet.js is mutable, which means that the object gets changed by method invocations. In order to work on explicit copies, use clone().

roaringbitmap - Roaring Bitmap in Cython

  •    Python

A roaring bitmap is an efficient compressed datastructure to store a set of integers. A Roaring bitmap stores a set of 32-bit integers in a series of arrays and bitmaps, whichever takes the least space (which is always 2 ** 16 bits or less). This datastructure is useful for storing a large number of integers, e.g., for an inverted index used by search engines and databases. In particular, it is possible to quickly compute the intersection of a series of sets, which can be used to implement a query as the conjunction of subqueries.

Bitter - A Swift Bits Manipulation/Bitwise Operations Toolkit

  •    Swift

For a Swift 3.x compatible version, check out release 2.0.5 or the swift-3 branch. If you want to install Bitter manually just include all the Swift files in Sources/Bitter in your project or load it as a git submodule.

bitmap-elixir - Bitmap implementation in Elixir using binaries and integers

  •    Elixir

In computing, a bitmap is a mapping from some domain (for example, a range of integers) to bits, that is, values which are zero or one. It is also called a bit array or bitmap index. This is an Elixir implementation of a bit array. Two implementations are provided as part of the library, Binary and Integer. Integers are the default due to clear performance superiority based on benchmarks provided below.