Alternatives and similar repositories for thmap

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

• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 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.
  ☆160Updated 3 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 8 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last week
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆72Updated last year
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆45Updated 11 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆60Updated 6 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆119Updated 2 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆66Updated 9 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆78Updated 9 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆58Updated last year
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated 2 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• rmind / rhashmap
  Robin Hood hash map library
  ☆62Updated 3 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆104Updated 9 months ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆80Updated 3 years ago
• MarkReedZ / mrloop
  An event loop for C using io_uring
  ☆48Updated last year