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
  ☆57Updated 6 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 6 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated last month
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆41Updated this week
• L-v-M / async
  ☆20Updated 2 years ago
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 5 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.
  ☆157Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• topling / topling-zip
  A data structure and algorithm library built for ToplingDB
  ☆57Updated 3 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆154Updated 11 months ago
• rmind / libqsbr
  QSBR and EBR library
  ☆118Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• zhuoyw / CLFQ
  Implementaions of concurrent lock-free SPSC queue in c++.
  ☆17Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• DolevAdas / Jiffy
  ☆44Updated 4 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆126Updated 6 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆212Updated last year
• MengRao / str
  A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching
  ☆128Updated 3 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 10 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 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)
  ☆78Updated 2 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆145Updated 5 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago