Alternatives and similar repositories for Log-Structured-Merge-Tree

Users that are interested in Log-Structured-Merge-Tree are comparing it to the libraries listed below

• dhanus / lsm-tree
  This is an implementation of a log structure merge tree.
  ☆59Updated 7 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• zk1931 / jzab
  ZooKeeper Atomic Broadcast in Java
  ☆54Updated 3 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• cmu-db / peloton-design
  Peloton Design Docs
  ☆27Updated 6 years ago
• MIT-DB-Class / simpleKV
  A simple Disk-based Key-Value Store
  ☆13Updated 6 years ago
• dibyendumajumdar / simpledbm
  SimpleDBM is an Open Source Multi-Threaded Embeddable Transactional Database Engine in Java.
  ☆59Updated last year
• Nov11 / 15-445
  CMU 15-445 2017 (force pushed to erase my works)
  ☆59Updated 5 years ago
• mit-pdos / dsrg
  Distributed Systems Reading Group
  ☆20Updated 7 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 7 years ago
• deepmehtait / Distributed-file-system-server-with-RAFT
  Distributed File System server implemented using RAFT Algorithm.
  ☆16Updated 5 years ago
• francis0407 / SQL-Engine-On-LSM
  A toy SQL engine built on top of LSM(LevelDB)
  ☆22Updated 5 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• apc999 / libcuckoo
  A high-performance, concurrent hash table
  ☆24Updated 11 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆27Updated 10 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆69Updated 10 years ago
• ssujeen / 15445-db
  Assignment for cmu database systems course 15445
  ☆7Updated 6 years ago
• ongardie / raft-pseudocode
  attempt at summarizing Raft in one page of pseudo-code
  ☆20Updated 7 years ago
• xinyisu79 / 6.824
  Implementation for MIT 6.824 Distributed System
  ☆14Updated 10 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 7 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 8 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
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• junjieliu2910 / cmu-15-445
  The project folder of the 15-445 Introduction to Database system
  ☆45Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 2 years ago