Alternatives and similar repositories for peloton-design

Users that are interested in peloton-design are comparing it to the libraries listed below

• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• JimChengLin / levi-db
  levi-db is a fast database engine
  ☆36Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 11 years ago
• tikv / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆121Updated last month
• HappyCS-Gu / Parallel-Raft-tla
  Specifying and Verfying concensus algorithms in PolarDB using TLA+
  ☆59Updated last year
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 6 years ago
• CatKang / Solitaire
  Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model
  ☆17Updated 7 years ago
• BLepers / KVell
  KVell: the Design and Implementation of a Fast Persistent Key-Value Store
  ☆289Updated 4 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• luyi0619 / aria
  GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database
  ☆74Updated last year
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆115Updated 4 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• pingcap / meetup
  ☆38Updated 5 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• pingcap / tla-plus
  ☆299Updated last year
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• turingcell / paxos-made-easy
  Paxos Made Easy: The Geometric Meaning and Geometric Proof of Paxos Algorithm
  ☆141Updated 4 years ago
• neverchanje / yaraft
  Yet Another RAFT implementation
  ☆125Updated 7 years ago
• SpanDB / SpanDB
  A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage
  ☆203Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• weicao / cascadb
  Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB
  ☆426Updated 12 years ago
• joker-qi / ndslDB
  基于LevelDB的改进
  ☆29Updated 6 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• yongwen / columbia
  An efficient database query optimizer for large complex join queries
  ☆136Updated 2 years ago
• tikv / sig-transaction
  Resources for the transaction SIG
  ☆62Updated 3 years ago
• rsy56640 / paper-reading
  record paper reading notes
  ☆42Updated 2 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• PingCAP-QE / horoscope
  horoscope is an optimizer inspector for DBMS.
  ☆36Updated 4 years ago