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
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆60Updated last year
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆139Updated 3 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆62Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆66Updated 9 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆77Updated last year
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• rmind / rhashmap
  Robin Hood hash map library
  ☆63Updated 3 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆51Updated 3 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆121Updated 3 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• MarkReedZ / mrloop
  An event loop for C using io_uring
  ☆48Updated last year
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆17Updated 4 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆16Updated 10 years ago
• ohad-rodeh / bt
  COW b-trees
  ☆102Updated 7 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last week
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated 3 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆155Updated 6 years ago
• frevib / epoll-echo-server
  ☆52Updated 5 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆61Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆68Updated last year