Alternatives and similar repositories for roaring-bitmap:

Users that are interested in roaring-bitmap are comparing it to the libraries listed below

• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆18Updated 9 months ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆114Updated 7 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• efficient / fast-succinct-trie
  ☆25Updated 8 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆36Updated 6 years ago
• efficient / ARF
  ☆11Updated 6 years ago
• reverbrain / eblob
  Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics
  ☆104Updated 5 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 9 years ago
• haproxy-unofficial-obsolete-mirrors / libslz
  Mirror of libslz
  ☆34Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• morten-krogh / trlmdb
  Trlmdb is a replicating database using time stamps.
  ☆14Updated 9 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 8 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 11 months ago
• xtreemfs / babudb
  An embedded non-relational database for Java and C++
  ☆37Updated 6 months ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 10 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• chriso / bitset
  A compressed bitset with supporting data structures and algorithms
  ☆19Updated 11 years ago