Alternatives and similar repositories for skl

Users that are interested in skl are comparing it to the libraries listed below

• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆61Updated last year
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆36Updated 3 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆80Updated 10 months ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆71Updated 4 months ago
• monoio-rs / local-sync
  ☆49Updated 6 months ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆62Updated 9 months ago
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆63Updated last year
• jedisct1 / rust-sieve-cache
  SIEVE cache replacement policy for Rust.
  ☆19Updated last month
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆67Updated 7 years ago
• tokio-rs / simulation
  Framework for simulating distributed applications
  ☆102Updated 5 years ago
• knizhnik / yakv
  Yet another key-value storage for Rust
  ☆72Updated 3 years ago
• datenlord / lockfree-cuckoohash
  A rust implementation of lock free cuckoo hashmap
  ☆69Updated 5 months ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆81Updated last year
• Xuanwo / serfig
  Layered configuration system built upon serde
  ☆32Updated 4 months ago
• komora-io / pagetable
  wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata
  ☆39Updated 10 months ago
• risingwavelabs / memcomparable
  A memcomparable serialization format.
  ☆23Updated 2 years ago
• kaimast / lsm-rs
  Modular, Asynchronous Implementation of a Log-Structured Merge Tree
  ☆41Updated last month
• rdaum / rart-rs
  An Adaptive Radix Tree implementation.
  ☆39Updated last year
• photondb / photonio
  An efficient runtime for asynchronous applications in Rust.
  ☆43Updated 2 years ago
• Lagrang / bztree-rs
  BzTree implementation for Rust
  ☆35Updated 2 years ago
• w0xel / sync_cow
  Thread-safe clone-on-write container for fast concurrent writing and reading.
  ☆49Updated 2 years ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆54Updated last month
• al8n / orderwal
  A generic-purpose, atomic, ordered, zero-copy read, zero-cost (in-place) write, Write-Ahead Log implementation for Rust.
  ☆22Updated 6 months ago
• Bajix / evlru
  An eventually consistent LRU designed for lock-free concurrent reads
  ☆22Updated 2 years ago
• m-ou-se / linux-futex
  Rust interface for Linux futexes, the fast user-space locking primitive.
  ☆87Updated last year
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆115Updated 4 months ago
• KuiBaDB / kbio
  Another Async IO Framework based on io_uring
  ☆63Updated 3 years ago
• penberg / bwtree-rs
  Bw-Tree for Rust
  ☆27Updated 2 years ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 10 months ago
• carllerche / mini-raft
  An implementation of Raft in Rust.
  ☆39Updated 2 years ago