komora-io / cache-advisorLinks
scan-resistant concurrent lazy LRU
☆63Updated 2 years ago
Alternatives and similar repositories for cache-advisor
Users that are interested in cache-advisor are comparing it to the libraries listed below
Sorting:
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 7 months ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆62Updated 7 months ago
- A low-level MVCC file format for storing blobs.☆64Updated last year
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 2 months ago
- Rust library implementing xor-filters☆140Updated 2 years ago
- Asynchronously speed-limiting multiple byte streams☆66Updated 11 months ago
- Rust implementation of Paxos consensus algorithm☆115Updated 2 years ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆115Updated 7 months ago
- Framework for simulating distributed applications☆104Updated 5 years ago
- heap profiler for rust☆28Updated last week
- rust database engineering toolkit☆32Updated 4 years ago
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆41Updated last year
- Yet another key-value storage for Rust☆72Updated 3 years ago
- An implementation of Raft in Rust.☆39Updated 2 years ago
- An eventually consistent LRU designed for lock-free concurrent reads☆23Updated 2 years ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- Library safely exposing the io_uring API.☆68Updated 3 weeks ago
- A lock-free, append-only atomic pool.☆68Updated 3 years ago
- SIEVE cache replacement policy for Rust.☆21Updated last month
- A global executor built on top of async-executor and smol☆74Updated last month
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆84Updated last year
- A fast implementation of single-pattern substring search using SIMD acceleration.☆98Updated last year
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated last month
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- Port of bbolt in Rust☆65Updated last year
- Modular, Asynchronous Implementation of a Log-Structured Merge Tree☆42Updated 3 months ago
- An on-disk hash table implementation☆124Updated 3 years ago
- A low-level I/O ownership and borrowing library☆104Updated last month
- A Write Ahead Log (WAL) implementation in Rust☆230Updated last year