Alternatives and similar repositories for IOManager:

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

• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆46Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆17Updated last week
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• eBay / HomeStore
  Storage Engine for block and key/value stores.
  ☆24Updated this week
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆44Updated last year
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 4 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆41Updated this week
• BU-DiSC / lethe-codebase
  ☆14Updated 3 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 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
• tuhhosg / exmap
  ☆45Updated last year
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆22Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• DBOS-project / dbos-scheduler
  ☆28Updated 3 years ago
• concord / zk
  zookeeper c++11. Uses facebook folly.
  ☆9Updated 9 years ago
• sfu-dis / skeena
  Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)
  ☆21Updated last year
• romange / midi-redis
  A toy memory store with great performance
  ☆34Updated 2 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 3 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆71Updated 3 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago