Alternatives and similar repositories for bloom:

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

• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated 8 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• 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
• technicolor-research / cuckoopp
  A high-performance hash-table for network packet-processing applications (compatible with DPDK)
  ☆36Updated 6 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago
• 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
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• Pfzuo / Path-Hashing
  A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)
  ☆29Updated 6 years ago
• wuwuz / Vacuum-Filter
  ☆50Updated 4 months ago
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆54Updated this week
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆221Updated this week
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• jonahharris / libcuckoofilter
  A C library implementation of a Cuckoo Filter
  ☆25Updated 3 years ago
• scality / quadiron
  Fast Erasure Coding Library for Large Number of Data and Parities
  ☆29Updated 4 years ago
• 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 3 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated last month
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• okuvshynov / b63
  Micro-benchmarking library for C and C++ with PMU counters tracking
  ☆61Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 6 years ago
• icsa-caps / ccKVS
  An RDMA skew-aware key-value store, which implements the Scale-Out ccNUMA design, to exploit skew in order to increase performance of dat…
  ☆19Updated 3 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• wheatman / BP-Tree
  ☆14Updated 2 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• cmpxchg16 / tsx.me
  Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox
  ☆24Updated 10 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆60Updated 4 years ago