anchorhash / cpp-anchorhash
AnchorHash - A Scalable Consistent Hash
☆25Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for cpp-anchorhash
- Using io_uring to implement a user space Linux fuse server☆41Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆38Updated 2 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆69Updated 3 years ago
- Concurrent trie-hash map library☆89Updated last year
- ☆20Updated last year
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆54Updated 4 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- ☆37Updated 6 months ago
- C implementation of the Raft Consensus protocol, BSD licensed☆71Updated last year
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆93Updated last month
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆17Updated 2 months ago
- a high performance cache simulator and library☆96Updated 2 months ago
- mpool UAPI and CLI for HSE 1.x☆35Updated 3 years ago
- Adaptive Radix Tree in C++☆37Updated 3 weeks ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆148Updated 3 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆245Updated 2 years ago
- zero-copy user-mode server. User-mode server which delegates zufs commands to specific file-system implementation.☆49Updated 4 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- Embedded DB Benchmark Framework☆58Updated 3 years ago
- QSBR and EBR library☆115Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 2 years ago
- pmwcas☆135Updated last year
- SPDK RocksDB mirror☆32Updated 3 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- Testing memory-level parallelism☆66Updated 8 months ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- ☆49Updated 4 years ago
- ☆26Updated 3 years ago