Alternatives and similar repositories for mtbl

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

• geofflangdale / sheng
  A small DFA for under 16 states
  ☆54Updated 7 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆38Updated 7 years ago
• jonasfj / trilite
  An inverted trigram index for accelerated string matching in Sqlite.
  ☆79Updated 11 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆109Updated 8 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 11 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆127Updated 2 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• DCSO / bloom
  A highly efficient Bloom filter library and command line tool written in Go.
  ☆77Updated 3 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆35Updated 2 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆34Updated 8 years ago
• tmetsch / python-dtrace
  A Python DTrace consumer using libdtrace - Now Python can be used as DTrace Provider and Consumer...
  ☆72Updated 3 years ago
• jvns / ltrace-bcc
  ltrace clone that uses bcc + uprobes instead of ptrace
  ☆48Updated 7 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• luceracloud / seqtest
  ☆20Updated 9 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆19Updated 7 months ago
• bolinfest / opensnoop-native
  opensnoop in pure C using eBPF
  ☆103Updated 9 months ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 years ago