4 repository-uri
Sorted in-memory structures that buffer writes before persisting them to disk.
Distinct from Memory Buffering: Specifically refers to the sorted MemTable pattern used in LSM-trees, not general volatile memory buffering.
Explore 4 awesome GitHub repositories matching web development · Sorted Memory Buffers. Refine with filters or upvote what's useful.
LevelDB is an embedded database library and persistent storage engine that provides a sorted key-value store. It uses a log-structured merge-tree architecture to map byte arrays to values, running directly within a process to provide storage without the need for a separate server process. The system is distinguished by its use of custom comparison functions to define key ordering, enabling efficient range scans and sequenced lookups. It ensures data reliability through atomic batch execution, consistent snapshot generation, and log-based recovery after failures. The engine covers broad capab
Buffers recent writes in a sorted MemTable before flushing them to immutable disk tables.
RocksDB is a high-performance, embeddable persistent key-value library and storage engine based on Log-Structured Merge-trees. It is designed to provide durable storage for large-scale datasets, integrating directly into applications to manage data on flash and RAM-based hardware. The engine is distinguished by its focus on minimizing read and write amplification through multi-threaded compaction and custom memory allocators. It features specialized optimizations for flash storage, including support for zoned block devices, and provides the ability to extend store behavior via external plugin
Buffers incoming writes in a sorted memory structure (MemTable) before flushing them as immutable sorted string tables.
goleveldb este o bază de date embedded de tip cheie-valoare pentru Go. Oferă persistența și indexarea locală a datelor, permițând aplicațiilor să stocheze și să preia informații folosind chei unice fără a necesita un server separat. Baza de date organizează datele folosind un log-structured merge-tree și indexare persistentă în ordine lexicografică. Această structură suportă scanări eficiente de interval și căutări bazate pe prefix. Sistemul include capabilități pentru scrieri atomice în lot pentru a asigura consistența datelor și a evita actualizările parțiale. Performanța este gestionată prin write-ahead logging, buffering bazat pe memorie și filtre bloom pentru a reduce input-ul și output-ul inutil pe disc.
Buffers recent writes in a sorted in-memory structure before flushing them to disk as immutable SSTables.
Mini-LSM is an educational storage engine and key-value database library designed to demonstrate the implementation of log-structured merge-tree architecture. It serves as a pedagogical resource for understanding how to build high-performance storage systems from the ground up, focusing on the mechanics of persistent data structures and disk-based storage. The project provides a functional framework for managing data through memory-to-disk flushing and multi-version concurrency control. It distinguishes itself by implementing snapshot-based isolation, which allows for consistent views of the
Buffers writes in sorted in-memory structures before flushing them as immutable files to persistent storage.