Alternatives and similar repositories for CLHT:

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

• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆79Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• flode / ARTSynchronized
  ☆116Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 7 years ago
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆156Updated last year
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆99Updated 2 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 6 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆55Updated 6 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• microsoft / pmwcas
  pmwcas
  ☆137Updated 2 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• Thesys-lab / Segcache
  ☆117Updated last year
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 8 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆112Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 4 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• pmem / pmem-rocksdb
  A version of RocksDB that uses persistent memory
  ☆92Updated 5 months ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆45Updated last year
• DICL / FAST_FAIR
  Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree
  ☆117Updated 4 years ago
• theoanab / SILK-USENIXATC2019
  Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19
  ☆90Updated 2 years ago
• epfl-labos / TRIAD
  ☆43Updated 3 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…
  ☆179Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• tuhhosg / exmap
  ☆45Updated last year
• L-v-M / async
  ☆20Updated 2 years ago