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
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆422Updated last week
• intel / isa-l_crypto
  ☆292Updated last week
• 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
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆250Updated 2 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• technicolor-research / cuckoopp
  A high-performance hash-table for network packet-processing applications (compatible with DPDK)
  ☆38Updated 7 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months ago
• llnl / metall
  Persistent memory allocator for data-centric analytics
  ☆60Updated 3 months ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 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
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• jvirkki / libbloom
  A simple and small bloom filter implementation in plain C.
  ☆304Updated 3 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 7 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆52Updated 8 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆12Updated last year
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• pmem / vmemcache
  Buffer based LRU cache
  ☆40Updated 2 years ago