Alternatives and similar repositories for roaring-bitmap

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

• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 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
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 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 6 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆126Updated 2 months ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated last week
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 7 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆55Updated 10 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 5 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• hyc / mleak
  malloc leak tracer
  ☆72Updated 3 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆79Updated 3 years ago
• RaphaelJ / fast_strstr
  A fast substitution to the stdlib's strstr() sub-string search function.
  ☆118Updated 10 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆19Updated 6 months ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆123Updated 3 years ago
• morten-krogh / trlmdb
  Trlmdb is a replicating database using time stamps.
  ☆14Updated 9 years ago
• haproxy-unofficial-obsolete-mirrors / libslz
  Mirror of libslz
  ☆34Updated 6 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆164Updated 10 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 5 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago