Alternatives and similar repositories for kvbench:

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

• vmware / node-replication
  An operation-log based approach for data replication.
  ☆62Updated last year
• komora-io / optimistic-cell
  ☆19Updated 2 years ago
• al8n / skl
  A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.
  ☆57Updated 3 weeks ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 6 months ago
• tokio-rs / simulation
  Framework for simulating distributed applications
  ☆98Updated 5 years ago
• PsiACE / bitsvec
  A bit vector with the Rust standard library's portable SIMD API.
  ☆39Updated last year
• u2 / stable-bloom-filter
  A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.
  ☆42Updated 5 years ago
• datenlord / lockfree-cuckoohash
  A rust implementation of lock free cuckoo hashmap
  ☆67Updated last month
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆53Updated last year
• jonhoo / bustle
  A benchmarking harness for concurrent key-value collections
  ☆117Updated 2 years ago
• flaneur2020 / llama2.rs
  🦙🦙.🦀
  ☆27Updated last year
• SabrinaJewson / completion.rs
  Completion futures for Rust
  ☆19Updated 2 years ago
• neondatabase / tokio-epoll-uring
  Use io_uring from vanilla tokio.
  ☆41Updated 3 months ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆69Updated last month
• RalfJung / rustc-build-sysroot
  Build a rustc sysroot with custom flags
  ☆17Updated 5 months ago
• Gregory-Meyer / cht
  Lockfree resizeable concurrent hash table.
  ☆54Updated 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.
  ☆70Updated 6 months ago
• cratesland / mea
  Mea provides async primitives and combinators that are runtime agnostic.
  ☆28Updated last week
• al8n / orderwal
  A generic-purpose, atomic, ordered, zero-copy read, zero-cost (in-place) write, Write-Ahead Log implementation for Rust.
  ☆20Updated 2 months ago
• gz / autoperf
  Simplify the use of performance counters.
  ☆64Updated 2 years ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆33Updated 2 years ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆77Updated last year
• risingwavelabs / memcomparable
  A memcomparable serialization format.
  ☆23Updated last year
• jedisct1 / rust-sieve-cache
  SIEVE cache replacement policy for Rust.
  ☆18Updated 2 weeks ago
• rdaum / rart-rs
  An Adaptive Radix Tree implementation.
  ☆38Updated last year
• dtolnay / bufsize
  bytes::BufMut implementation to count buffer size
  ☆22Updated 2 weeks ago
• photondb / photonio
  An efficient runtime for asynchronous applications in Rust.
  ☆43Updated 2 years ago
• NeowayLabs / bplustree
  Concurrent in-memory B+ Tree featuring optimistic lock coupling
  ☆21Updated 2 years ago
• ConnectEverything / caspaxos-kv
  Rust CASPaxos implementation
  ☆66Updated 4 years ago