Alternatives and similar repositories for lsmdb:

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

• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• vmg / libewok
  EWAH Compressed Bitmaps
  ☆25Updated 4 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• biokoda / actordb_driver
  actordb storage engine
  ☆19Updated 5 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆36Updated 6 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 8 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 7 years ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆37Updated 3 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated last year
• glk / critbit
  Crit-bit tree
  ☆26Updated 3 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• backtrace-labs / bcd
  Simple out-of-process invoker
  ☆18Updated 8 months ago
• haproxy-unofficial-obsolete-mirrors / libslz
  Mirror of libslz
  ☆34Updated 5 years ago
• dcreager / libpush
  An arrow-based parser combinator library for C
  ☆40Updated 14 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆119Updated 2 years ago
• chriso / columnix
  Columnar storage and query engine
  ☆9Updated 6 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆53Updated 2 years ago