Alternatives and similar repositories for bloom:

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

• wuwuz / Vacuum-Filter
  ☆50Updated last month
• 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
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• Pfzuo / Path-Hashing
  A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)
  ☆29Updated 6 years ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated 6 months ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• InstLatx64 / InstLatX64_Demo
  InstLatX64_Demo
  ☆41Updated this week
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• TheHolyJoker / Comparing-Filters
  Benchmarking Bloom, Cuckoo, Morton, and PD based filter.
  ☆14Updated 2 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• snalli / nstore
  NVM Database from Carnegie-Mellon U
  ☆24Updated 4 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆108Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated last year
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆74Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆23Updated 11 months ago
• aliireza / packetmill
  PacketMill: Toward per-core 100-Gbps Networking
  ☆62Updated 2 years ago
• zhoutl1106 / zerasure
  Source code for the FAST'19 paper "Fast Erasure Coding for Data Storage: A Comprehensive Study of the Acceleration Techniques", Tianli Zh…
  ☆17Updated 3 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆39Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• domargan / awesome-numa
  A community-oriented list of useful NUMA-related libraries, tools, and other resources
  ☆66Updated 4 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 10 months ago
• cmpxchg16 / tsx.me
  Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox
  ☆23Updated 10 years ago