Alternatives and similar repositories for anna-cache

Users that are interested in anna-cache are comparing it to the libraries listed below

• DBOS-project / dbos-scheduler
  ☆28Updated 4 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 3 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated 8 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆55Updated 5 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated last year
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆48Updated 2 years ago
• futurewei-cloud / QuantaDB
  ☆14Updated 2 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 9 months ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• futurewei-cloud / chogori-platform
  ☆46Updated 2 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• tuhhosg / exmap
  ☆49Updated 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 / Hawk-VLDBJ
  ☆15Updated 6 years ago
• danyangz / lightning
  Lightning In-Memory Object Store
  ☆47Updated 3 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago