Alternatives and similar repositories for bloom

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

• TheHolyJoker / Comparing-Filters
  Benchmarking Bloom, Cuckoo, Morton, and PD based filter.
  ☆15Updated 3 years ago
• intel / isa-l_crypto
  ☆292Updated 2 weeks ago
• ceph / gf-complete
  this repository is a read only mirror, the upstream is
  ☆75Updated 3 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• technicolor-research / cuckoopp
  A high-performance hash-table for network packet-processing applications (compatible with DPDK)
  ☆38Updated 7 years ago
• kroki / Cuckoo-hash
  C library implementing cuckoo hash
  ☆51Updated 13 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• scality / quadiron
  Fast Erasure Coding Library for Large Number of Data and Parities
  ☆29Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• catid / snowshoe
  Snowshoe - Portable, Secure, Fast Elliptic Curve Math Library in C
  ☆63Updated 8 years ago
• catid / leopard
  Leopard-RS : O(N Log N) MDS Reed-Solomon Block Erasure Code for Large Data
  ☆157Updated last year
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• SianJhengLin / Fast-algorithms-of-Reed-Solomon-erasure-codes
  ☆22Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• htot / crc32c
  Fastest crc32c algorithms for i686 and x86_64 including benchmarks
  ☆92Updated 8 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.
  ☆167Updated 4 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• intel / soft-crc
  ISA-L and intel-ipsec-mb obsolete soft-crc project. Please refer and use them instead for efficient CRC implementation. https://github.co…
  ☆56Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆52Updated 8 years ago
• jvirkki / libbloom
  A simple and small bloom filter implementation in plain C.
  ☆304Updated 3 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆48Updated 12 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• pmem / vmemcache
  Buffer based LRU cache
  ☆40Updated 2 years ago
• WojciechMula / ternarylogiccli
  CLI utilty to work out proper constants for vpternlogic instruction
  ☆13Updated 3 years ago