Alternatives and similar repositories for libbloom

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

• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• armon / libart
  Adaptive Radix Trees implemented in C
  ☆800Updated 3 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 4 years ago
• PeterScott / murmur3
  Murmur3 hash in C
  ☆423Updated 3 years ago
• mavam / libbf
  Bloom filters for C++11
  ☆362Updated 3 years ago
• amadvance / tommyds
  A C library of hashtables and tries designed to store objects with high performance
  ☆236Updated 2 years ago
• agl / critbit
  Critbit trees in C
  ☆337Updated 3 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• willemt / ticketd
  A distributed durable unique 64bit ID server
  ☆204Updated 7 years ago
• simonhf / sharedhashfile
  Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
  ☆473Updated 4 years ago
• wahern / timeout
  timer.c: Tickless hierarchical timing wheel
  ☆233Updated last year
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• kuszmaul / SuperMalloc
  A Super Fast Multithreaded malloc() for 64-bit Machines
  ☆291Updated 5 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• begeekmyfriend / CuckooFilter
  Substitute for bloom filter.
  ☆330Updated 4 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago
• adamierymenko / kissdb
  (Keep It) Simple Stupid Database
  ☆367Updated 9 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆140Updated 5 years ago
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆192Updated 3 weeks ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆142Updated 2 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆291Updated 5 years ago
• jonahharris / libcuckoofilter
  A C library implementation of a Cuckoo Filter
  ☆26Updated 3 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• aisk / libae
  redis's async event loop library
  ☆189Updated 5 years ago