Alternatives and similar repositories for LSM-Tree:

Users that are interested in LSM-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
• mitdbg / treeline
  An update-in-place key-value store for modern storage.
  ☆140Updated last year
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• EighteenZi / rocksdb_wiki
  ☆93Updated last year
• jackdent / cs265-lsm-tree
  A key-value store implemented as a Log-Structured Merge Tree in C++
  ☆71Updated 7 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• purduedb / OpenAurora
  OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …
  ☆90Updated last month
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 5 months ago
• shreyas-gopalakrishna / Concurrent-Skip-list
  The concurrent skip list is a multithreaded implementation of the skip list data structure where the insert, delete, get and range operat…
  ☆25Updated 4 years ago
• durner / AnyBlob
  AnyBlob - A Universal Cloud Object Storage Download Manager Built For Cost-Throughput Optimal Analytics!
  ☆124Updated last month
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆46Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆157Updated last year
• learnedsystems / RMI
  The recursive model index, a learned index structure
  ☆222Updated 3 years ago
• viktorleis / mmapbench
  ☆137Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆45Updated 11 months ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆102Updated last month
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆255Updated 6 years ago
• eileen-code4fun / LSM-Tree
  A simplified implementation for log structured merge tree.
  ☆61Updated 4 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 3 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆52Updated 2 weeks ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆56Updated last week
• Thesys-lab / Segcache
  ☆118Updated last year
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• Qiaolin-Yu / paper-reading
  A list of papers I have read.
  ☆13Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 6 months ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago