Alternatives and similar repositories for CLHT

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

• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 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)
  ☆83Updated 3 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last week
• flode / ARTSynchronized
  ☆124Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆159Updated 6 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• Thesys-lab / Segcache
  ☆121Updated 2 years ago
• pmem / rpma
  Remote Persistent Memory Access Library
  ☆104Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆111Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆181Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆116Updated 4 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 7 months ago
• Thesys-lab / sosp23-s3fifo
  The repo for SOSP23 paper: FIFO queues are all you need for cache evictions
  ☆131Updated last year
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago