rdaum / rart-rs
An Adaptive Radix Tree implementation.
☆38Updated last year
Alternatives and similar repositories for rart-rs:
Users that are interested in rart-rs are comparing it to the libraries listed below
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated last year
- scan-resistant concurrent lazy LRU☆58Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆69Updated last month
- ☆41Updated 4 months ago
- A low-level MVCC file format for storing blobs.☆63Updated last year
- log for concurrent workloads, with support for atomic batches and in-order recovery☆33Updated 2 years ago
- A generic-purpose, atomic, ordered, zero-copy read, zero-cost (in-place) write, Write-Ahead Log implementation for Rust.☆20Updated 2 months ago
- A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.☆57Updated last month
- Framework for simulating distributed applications☆98Updated 5 years ago
- ☆19Updated 2 years ago
- Library safely exposing the io_uring API.☆60Updated this week
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆70Updated 6 months ago
- A flexible and convenient high-level mmap for zero-copy file I/O.☆111Updated last month
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- FoundationDB client API for Tokio☆45Updated last year
- Port of bbolt in Rust☆65Updated 5 months ago
- Thin immutable zero-copy byte slice☆27Updated this week
- An async RPC in rust-lang that mimics golang's net/rpc☆30Updated 11 months ago
- A reader-writer lock that provides extremely fast read access without starving writers☆77Updated last year
- Pure-Rust implementation of Fast Static Symbol Tables string compression☆124Updated this week
- A high-performance SPSC bounded circular buffer of bytes☆47Updated 9 months ago
- A benchmarking harness for concurrent key-value collections☆117Updated 2 years ago
- An LRU cache implementation with constant time operations and weighted semantic.☆43Updated 3 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆89Updated 7 months ago
- Rust implementation of the FastLanes compression library☆95Updated 2 weeks ago
- ☆46Updated 3 months ago
- A memcomparable serialization format.☆23Updated last year
- Bw-Tree for Rust☆26Updated last year
- Adaptive Radix Tree in Rust☆67Updated 6 years ago
- Collection of insert-only wait-free data-structures.☆29Updated last year