memtable

A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.

A LSM-Tree key/value database in Python.

LSM Tree Key Value Storage Engine

A complete LSM tree key-value storage engine written in Go. Implements SSTables, memtables, and write-ahead logging with a modern Wails and React desktop interface

Log-Structured Merge-tree (LSM Tree) storage engine with in-memory MemTable, SSTables, and compaction.

Production-grade genpark-lsm-tree-compaction-memtable-engine-skill skill for AI agents

Log-Structured Merge-tree (LSM Tree) storage engine with in-memory MemTable, SSTables, and compaction.

Production-grade genpark-lsm-tree-compaction-memtable-engine-skill skill for AI agents

Lock free, arena-backed skip list memtable for LSM storage engines.

Lock-free, ordered and multiple version memory table for key-value databases.

Modular C++ key-value storage engine implementing an LSM-tree with WAL and SSTables.

Rust NoSQL key-value engine with get, set, wal, merkle tree, memtables, sstables, compression & probabilistic types.

Log Structured Merge Tree

An educational arena-backed memtable in C with sorted linked-list storage, length-prefixed key-value encoding and atomic arena allocation.

Key-Value storage system implemented in go for the subject "Napredni algoritmi i strukture podataka" at Faculty of Technical Sciences, Novi sad

A lightweight LSM-Tree key-value storage engine written in Go, featuring a B-tree MemTable, Write-Ahead Log, and SSTable compaction

A high-performance key-value store in Go with LSM tree, compaction algorithms, rate limiting, and support for probabilistic data structures like Bloom Filter and SimHash. It also features range scan and list operations with pagination.

A production grade LSM tree storage engine built from scratch in modern C++

Distributed write-heavy database built with an LSM storage engine. It supports distributed transactions across multiple partitions, Raft-style leader election per partition with follower read replicas, and multiple consistency semantics, including strong consistency, bounded-staleness reads, and eventual consistency. Consistency can be selected per

A simple log-structured key-value database engine written in Go, inspired by LSM-tree designs.