Alternatives and similar repositories for dbbench:

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

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆94Updated 5 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• KioxiaAmerica / trocksdb
  RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance
  ☆55Updated 4 years ago
• pmem / vmemcache
  Buffer based LRU cache
  ☆38Updated last year
• hse-project / mpool
  mpool UAPI and CLI for HSE 1.x
  ☆35Updated 3 years ago
• trigonak / ssmp
  ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.
  ☆22Updated 9 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 3 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆157Updated 3 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 4 months ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• westerndigitalcorporation / hmmap
  Heterogeneous memory mapper (hmmap)
  ☆10Updated 4 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆69Updated 10 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 4 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• NetApp / zufs-zus
  zero-copy user-mode server. User-mode server which delegates zufs commands to specific file-system implementation.
  ☆50Updated 4 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆41Updated this week
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago