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
  ☆356Updated 3 years ago
• tstarling / thread-safe-lru
  A C++ template class providing a thread-safe LRU cache
  ☆76Updated 3 years ago
• Tessil / hat-trie
  C++ implementation of a fast and memory efficient HAT-trie
  ☆814Updated 6 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆154Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆274Updated 3 months ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆213Updated last year
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆142Updated 2 years ago
• petegoodliffe / skip_list
  STL-style C++ skip_list container
  ☆87Updated 2 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆347Updated 6 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 …
  ☆294Updated 6 months ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆407Updated 2 months ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆269Updated last year
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆488Updated last year
• sparsehash / sparsehash-c11
  Experimental C++11 version of sparsehash
  ☆289Updated 2 years 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 3 months ago
• miloyip / itoa-benchmark
  C++ integer-to-string conversion benchmark
  ☆340Updated last month
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆146Updated 5 years ago
• Tessil / hopscotch-map
  C++ implementation of a fast hash map and hash set using hopscotch hashing
  ☆738Updated 6 months ago
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆246Updated 3 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆262Updated last year
• lamerman / cpp-lru-cache
  Simple and reliable LRU cache for c++ based on hashmap and linkedlist
  ☆374Updated 4 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 6 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• kshk123 / hashMap
  A concurrent thread-safe hash map implemented in C++
  ☆145Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• kephir4eg / trie
  C++ implementation of Radix tree
  ☆61Updated 5 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆429Updated last year
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆307Updated last year
• efficient / libcuckoo
  A high-performance, concurrent hash table
  ☆1,645Updated 4 months ago