Alternatives and similar repositories for sharded-log

Users that are interested in sharded-log are comparing it to the libraries listed below

• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆72Updated 9 months ago
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆63Updated 2 years ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆54Updated 4 months ago
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆64Updated last year
• komora-io / pagetable
  wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata
  ☆41Updated last year
• komora-io / optimistic-cell
  ☆21Updated 3 years ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆38Updated last year
• al8n / skl
  A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.
  ☆63Updated 9 months ago
• komora-io / fault-injection
  trigger io::Error's in test, and annotate their source
  ☆31Updated 2 years ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆67Updated last year
• rdaum / rart-rs
  An Adaptive Radix Tree implementation.
  ☆45Updated 4 months ago
• tokio-rs / simulation
  Framework for simulating distributed applications
  ☆104Updated 5 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆85Updated last year
• carllerche / mini-raft
  An implementation of Raft in Rust.
  ☆39Updated 2 years ago
• declanvk / blart
  ☆57Updated 2 months ago
• komora-io / inline-array
  ☆12Updated 3 months ago
• kaimast / lsm-rs
  Modular, Asynchronous Implementation of a Log-Structured Merge Tree
  ☆42Updated 6 months ago
• nextest-rs / future-queue
  Queue futures to run concurrently, in the order they're spawned, and with global and group limits.
  ☆66Updated this week
• monoio-rs / local-sync
  ☆51Updated 11 months ago
• jonhoo / indexmap-amortized
  bluss/IndexMap with amortized resizes
  ☆14Updated 4 years ago
• jedisct1 / rust-sieve-cache
  SIEVE cache replacement policy for Rust.
  ☆21Updated 3 months ago
• main-- / rust-eytzinger
  This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…
  ☆24Updated 2 weeks ago
• knizhnik / yakv
  Yet another key-value storage for Rust
  ☆72Updated 3 years ago
• prataprc / xorfilter
  Rust library implementing xor-filters
  ☆142Updated 2 years ago
• Bajix / evlru
  An eventually consistent LRU designed for lock-free concurrent reads
  ☆22Updated 2 years ago
• benschulz / paxakos
  Rust implementation of Paxos consensus algorithm
  ☆115Updated 2 years ago
• Thomasdezeeuw / a10
  Library safely exposing the io_uring API.
  ☆70Updated 2 weeks ago
• u2 / stable-bloom-filter
  A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.
  ☆42Updated 6 years ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆86Updated 2 years ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆117Updated 9 months ago