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 9 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
  ☆52Updated 14 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆124Updated last year
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆53Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 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
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• RaphaelJ / fast_strstr
  A fast substitution to the stdlib's strstr() sub-string search function.
  ☆117Updated 10 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆162Updated 10 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆54Updated 10 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆18Updated last month
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 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
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• aolarchive / ribs2
  RIBS (Robust Infrastructure for Backend Systems) version 2
  ☆130Updated 6 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆73Updated 4 years ago
• haproxy-unofficial-obsolete-mirrors / libslz
  Mirror of libslz
  ☆34Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 7 years ago