CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
☆166Oct 4, 2021Updated 4 years ago
Alternatives and similar repositories for CLHT
Users that are interested in CLHT are comparing it to the libraries listed below
Sorting:
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Jan 19, 2018Updated 8 years ago
- ☆17Sep 26, 2022Updated 3 years ago
- ☆17May 26, 2023Updated 2 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Apr 21, 2023Updated 2 years ago
- ☆18Sep 12, 2025Updated 5 months ago
- ☆99Nov 19, 2020Updated 5 years ago
- ☆126Apr 8, 2022Updated 3 years ago
- pmwcas☆139Apr 7, 2023Updated 2 years ago
- Scalable Hashing on Persistent Memory☆194Apr 16, 2024Updated last year
- ☆15Mar 31, 2022Updated 3 years ago
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆50Mar 18, 2021Updated 4 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Mar 28, 2017Updated 8 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- LB+-Tree implementation☆49Apr 4, 2021Updated 4 years ago
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆526Nov 14, 2018Updated 7 years ago
- A benchmark to compare synchronization techniques for multicore programming☆348Jul 3, 2025Updated 7 months ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 4 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated last year
- Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory (OSDI 2018, TOS 2019)☆204Jul 20, 2020Updated 5 years ago
- ☆50Aug 20, 2020Updated 5 years ago
- ☆28Mar 17, 2024Updated last year
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- Artifact for PPoPP'18☆19Apr 11, 2022Updated 3 years ago
- QSBR and EBR library☆135Dec 15, 2019Updated 6 years ago
- C++ bindings & containers for libpmemobj☆110Mar 22, 2023Updated 2 years ago
- A high-performance distributed graph database based on RDMA.☆18Apr 6, 2022Updated 3 years ago
- Universal Presentation: A Header-only C++ Library to Cout STL containers and more☆18Aug 14, 2023Updated 2 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆22Apr 16, 2025Updated 10 months ago
- Automatically exported from code.google.com/p/libhhash☆32Dec 6, 2015Updated 10 years ago
- ☆30Sep 14, 2022Updated 3 years ago
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- ☆124Jul 10, 2023Updated 2 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆43Dec 12, 2022Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Adaptive Radix Trees implemented in C☆819Mar 21, 2022Updated 3 years ago
- Multicore in-memory storage engine☆399Oct 10, 2017Updated 8 years ago
- ☆13Oct 14, 2024Updated last year
- Nap - NUMA-Aware Persistent Indexes☆41May 27, 2021Updated 4 years ago