Alternatives and similar repositories for bloom

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

• mavam / libbf
  Bloom filters for C++11
  ☆358Updated 3 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆278Updated 5 months ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated 2 years ago
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆142Updated 2 years ago
• tstarling / thread-safe-lru
  A C++ template class providing a thread-safe LRU cache
  ☆76Updated 3 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆271Updated last year
• Tessil / hat-trie
  C++ implementation of a fast and memory efficient HAT-trie
  ☆820Updated 8 months ago
• mohaps / lrucache11
  A header only C++11 LRU Cache template class that allows you to define key, value and optionally the Map type. uses a double linked list …
  ☆295Updated 8 months ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆264Updated 2 years ago
• sparsehash / sparsehash-c11
  Experimental C++11 version of sparsehash
  ☆290Updated 2 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆262Updated 2 years ago
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆492Updated last year
• lamerman / cpp-lru-cache
  Simple and reliable LRU cache for c++ based on hashmap and linkedlist
  ☆379Updated 4 years ago
• Tessil / hopscotch-map
  C++ implementation of a fast hash map and hash set using hopscotch hashing
  ☆742Updated 8 months ago
• petegoodliffe / skip_list
  STL-style C++ skip_list container
  ☆87Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆411Updated 4 months ago
• efficient / libcuckoo
  A high-performance, concurrent hash table
  ☆1,667Updated 2 months ago
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆247Updated 4 years ago
• vpetrigo / caches
  C++ cache with LRU/LFU/FIFO policies implementation
  ☆362Updated 2 weeks ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 5 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆309Updated 2 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆148Updated 5 years ago
• HiWong / SkipListPro
  Probably the best implementation for SkipList written by C++
  ☆123Updated 2 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆349Updated 8 months ago
• UncP / aili
  the fastest in-memory index in the East 东半球最快并发索引
  ☆474Updated 4 years ago
• kephir4eg / trie
  C++ implementation of Radix tree
  ☆63Updated 5 years ago
• miloyip / itoa-benchmark
  C++ integer-to-string conversion benchmark
  ☆341Updated 3 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• kshk123 / hashMap
  A concurrent thread-safe hash map implemented in C++
  ☆145Updated 2 years ago