Alternatives and similar repositories for bloom:

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

• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• wuwuz / Vacuum-Filter
  ☆50Updated 2 months ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated 7 months ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• jonahharris / libcuckoofilter
  A C library implementation of a Cuckoo Filter
  ☆25Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 9 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆273Updated last month
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• technicolor-research / cuckoopp
  A high-performance hash-table for network packet-processing applications (compatible with DPDK)
  ☆36Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆214Updated this week
• westerndigitalcorporation / libzbd
  Zoned block device manipulation library and tools
  ☆71Updated 8 months ago
• vkrasnov / vpmadd
  Multiplication using AVX512 and AVX512IFMA instructions
  ☆23Updated 9 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆35Updated 5 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆24Updated last year
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆52Updated this week
• aajayssingh / concurrent-persistent-datastructure
  The rep contains my experiments with state of the art NVM programming abstractions during my internship at Regal Lab of Inria Paris under…
  ☆11Updated 4 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 3 years ago