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
  ☆156Updated 7 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.
  ☆162Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆155Updated 6 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆101Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 9 months ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• Thesys-lab / Segcache
  ☆121Updated 2 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…
  ☆180Updated 7 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆106Updated 11 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• pmem / rpma
  Remote Persistent Memory Access Library
  ☆103Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆194Updated last year
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆113Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 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)
  ☆80Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 years ago
• viktorleis / mmapbench
  ☆138Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 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
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• epfl-labos / TRIAD
  ☆44Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆59Updated 3 months ago
• viktorleis / vmcache
  ☆72Updated 4 months ago