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
  ☆794Updated 3 years ago
• agl / critbit
  Critbit trees in C
  ☆335Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆250Updated 4 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• willemt / ticketd
  A distributed durable unique 64bit ID server
  ☆202Updated 6 years ago
• begeekmyfriend / CuckooFilter
  Substitute for bloom filter.
  ☆328Updated 4 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• mavam / libbf
  Bloom filters for C++11
  ☆358Updated 3 years ago
• simonhf / sharedhashfile
  Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes
  ☆471Updated 4 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆119Updated 5 years ago
• wahern / timeout
  timer.c: Tickless hierarchical timing wheel
  ☆231Updated last year
• 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
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆365Updated 4 months ago
• PeterScott / murmur3
  Murmur3 hash in C
  ☆421Updated 2 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• chaoran / fast-wait-free-queue
  A benchmark framework for concurrent queue implementations
  ☆291Updated 5 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆441Updated last year
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• goossaert / kingdb
  Fast on-disk persistent key-value store
  ☆387Updated 6 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆159Updated 3 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• rescrv / HyperLevelDB
  A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.
  ☆462Updated 9 years ago
• HdrHistogram / HdrHistogram_c
  C port of the HdrHistogram
  ☆248Updated 6 months ago
• adamierymenko / kissdb
  (Keep It) Simple Stupid Database
  ☆365Updated 9 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• embedded2016 / bplus-tree
  B+ tree implementation in C
  ☆131Updated 4 years ago
• lemire / EWAHBoolArray
  A compressed bitmap class in C++.
  ☆452Updated 7 months ago