syndtr/goleveldb
Goleveldb
goleveldb is an embedded key-value storage database for Go. It provides local data persistence and indexing, allowing applications to store and retrieve information using unique keys without requiring a separate server.
The database organizes data using a log-structured merge-tree and persistent indexing in lexicographical order. This structure supports efficient range scans and prefix-based searches.
The system includes capabilities for atomic batch writes to ensure data consistency and avoid partial updates. Performance is managed through write-ahead logging, memory-based buffering, and bloom filters to reduce unnecessary disk input and output.
Features
- Log-Structured Merge-Trees - Implements a Log-Structured Merge-Tree architecture to optimize write throughput by turning random writes into sequential I/O.
- Lexicographical Sorting - Stores keys in a strict byte-order sequence to enable efficient range scans and prefix-based searches.
- Lexicographical Indexes - Implements a persistent index in lexicographical order to support efficient range scans and prefix-based searches on disk.
- Embedded Database Integrations - Integrates directly into Go applications as a library to handle local persistence without a separate server.
- Key-Value Store Iterators - Implements utilities for traversing sorted key-value pairs in lexicographical order via range scans.
- Range Key Iterators - Provides iterators to traverse key-value pairs over contiguous ranges using specific keys or prefix filters.
- Embedded Key-Value Stores - Provides an embedded key-value store that persists data on disk using an LSM-tree.
- Atomic Page Updates - Groups write operations together to prevent partial updates and ensure consistency during system failures.
- Database Atomic Batches - Provides capabilities to group multiple mutations into a single atomic operation to ensure data consistency.
- LSM-Tree Batch Writes - Groups multiple put and delete operations into a single commit to reduce write amplification.
- Disk I/O Optimizations - Reduces disk reads by using specialized structures to verify key existence before accessing physical storage.
- SSTable Indexes - Persists data in immutable sorted string tables with index blocks for fast binary search retrieval.
- Key Lookup Operations - Optimizes key lookups by using probabilistic data structures to avoid unnecessary disk I/O.
- Bloom Filters - Uses Bloom filters as probabilistic membership tests to optimize disk retrieval by skipping irrelevant files.
- Atomic Index Updates - Ensures database mutations are applied as single atomic units to maintain data consistency.
- Write-Ahead Logging - Records every mutation to a sequential disk log to ensure data recovery and durability after crashes.
- Write Buffering - Uses memory buffers and sequential logs to accumulate writes and minimize disk latency.
- Atomic Write Coordinators - Groups multiple write operations into a single atomic unit to guarantee all-or-nothing execution.
- LSM Memtables - Buffers recent writes in a sorted in-memory structure before flushing them to disk as immutable SSTables.
- Database Engines - Go implementation of the LevelDB key/value database.
- Database Systems - Listed in the “Database Systems” section of the Awesome Go awesome list.
- Database Tools - LevelDB implementation in Go.
- Databases - Go implementation of the LevelDB storage engine.
- Databases and Storage - A Go implementation of the LevelDB key-value store.
- Databases & Data - Implementation of a key/value store based on LevelDB.
- Embedded Databases - Go implementation of the LevelDB key-value store.
Star history
How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.
