LPD-EPFL / CLHT
CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
☆158Updated 3 years ago
Alternatives and similar repositories for CLHT:
Users that are interested in CLHT are comparing it to the libraries listed below
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 6 months ago
- HOT - Height Optimized Trie☆149Updated 7 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆99Updated 2 years ago
- ☆119Updated 3 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- a high performance cache simulator and library☆103Updated 8 months ago
- ☆143Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆152Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- pmwcas☆137Updated 2 years ago
- ☆53Updated 11 months ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- LSM-trie☆113Updated 4 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆57Updated 2 weeks ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- Remote Persistent Memory Access Library☆103Updated last year
- ☆25Updated 8 years ago
- The Cicada engine☆57Updated 7 years ago
- ☆20Updated 2 years ago
- ☆43Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A version of RocksDB that uses persistent memory☆92Updated 6 months ago
- ☆28Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆58Updated 6 years ago
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆90Updated 2 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆51Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆159Updated last year