Alternatives and similar repositories for mtbl

Users that are interested in mtbl are comparing it to the libraries listed below

• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• awgn / captop
  Utility to measure the performance of pcap network interfaces.
  ☆21Updated 4 years ago
• jonasfj / trilite
  An inverted trigram index for accelerated string matching in Sqlite.
  ☆79Updated 11 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆52Updated 7 years ago
• circonus-labs / libmtev
  Mount Everest Application Framework
  ☆119Updated last week
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 5 years ago
• DCSO / bloom
  A highly efficient Bloom filter library and command line tool written in Go.
  ☆77Updated 3 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• DNS-OARC / omg-dns
  Moved to https://codeberg.org/DNS-OARC/omg-dns
  ☆16Updated last month
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆18Updated 4 months ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 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
• vedantk / quotient-filter
  a quotient filter written in C
  ☆87Updated 8 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• nmathewson / libottery
  A fast secure userspace pseudorandom number generator
  ☆83Updated 11 years ago
• efficient / ARF
  ☆11Updated 7 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(…
  ☆50Updated last year
• veorq / blabla
  like ChaCha, but 64-bit instead of 32-bit thanks to BLAKE2b's permutation
  ☆15Updated 8 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 10 years ago