Alternatives and similar repositories for tiered-storage

Users that are interested in tiered-storage are comparing it to the libraries listed below

• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 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 8 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 4 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 7 months ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 4 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
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 5 years ago
• apache / incubator-retired-quickstep
  Apache Quickstep Incubator - This project is retired
  ☆95Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆33Updated 4 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 4 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• rystsov / caspaxos
  CASPaxos: Replicated State Machines without logs
  ☆100Updated 6 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆43Updated 2 years ago
• UWSysLab / specpaxos
  Speculative Paxos replication protocol
  ☆130Updated 8 years ago
• belliottsmith / accord
  ☆26Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 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