Alternatives and similar repositories for LockFreeCuckooHash

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

• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆149Updated 5 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆47Updated this week
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 6 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 4 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 3 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• MengRao / str
  A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching
  ☆128Updated 4 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated 2 months ago
• rigtorp / TokenBucket
  Lock-free implementation of the token bucket algorithm in C++
  ☆61Updated 2 years ago
• zhuoyw / CLFQ
  Implementaions of concurrent lock-free SPSC queue in c++.
  ☆17Updated 7 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆268Updated 2 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆165Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆277Updated 2 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 5 months ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last week
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• topling / topling-zip
  A data structure and algorithm library built for ToplingDB
  ☆60Updated last week