Redb

Features

ACID Transactional Cores - Provides an ACID-compliant transactional core with atomic, consistent, isolated, and durable operations.
Embedded Key-Value Stores - Provides an ACID-compliant embedded key-value store with BTree-based persistent storage.
Concurrent Read-Write Transactions - Uses MVCC to isolate concurrent transactions, allowing non-blocking reads and writes.
BTree-Based Storage - Uses a B-tree structure to organize persistent key-value data with ordered access.
Atomic Commit Logs - Writes batches of changes as single atomic units to prevent partially-updated states.
Atomic Batch Commits - Provides atomic batch commits that ensure groups of writes are applied as single units.
BTreeMap-Based Storage Engines - Provides a BTreeMap-based storage engine with zero-copy, thread-safe data access.
Single-Writer Multi-Reader Stores - Implements a single-writer multi-reader model with MVCC for concurrent data access.
Multi-Version Concurrency Control - Allows multiple readers and a single writer to operate simultaneously using multi-version concurrency control.
Persistent Application State - Saves application state to disk reliably with automatic recovery after crashes or restarts.
Single-Writer Multi-Reader Locking - Employs a single-writer multi-reader locking model for coordinated concurrent access.
ACID-Compliant - Ships an ACID-compliant storage engine with crash safety and rollback support.
MVCC Implementations - Implements MVCC to manage concurrent access with multiple data versions for non-blocking reads.
BTree-Based MVCC Engines - Uses BTree-based persistent storage with MVCC to manage concurrent reads and writes without blocking.
Write-Ahead Logging - Implements write-ahead logging to ensure durability and crash recovery for all mutations.
Memory-Mapped I/O - Maps storage files directly into process memory for efficient data access without system calls.
Ordered Map Data Access - Provides ordered map data access through a BTreeMap interface with range query support.
BTreeMap - Provides a BTreeMap query interface for ordered key-value access without raw query syntax.
BTreeMap APIs - Provides a zero-copy BTreeMap interface for intuitive, thread-safe key-value access.
BTreeMap Key-Value Access - Offers a BTreeMap-like API for zero-copy, thread-safe key-value access.

Open-source alternatives to Redb

Similar open-source projects, ranked by how many features they share with Redb.

boltdb/bolt
boltdb/bolt
14,642View on GitHub
Bolt is a single-file embedded key-value store for Go applications. It is an ACID transactional database that organizes data in B+trees on disk to provide efficient sorted key retrieval and range scans. The system uses a memory-mapped model to map the database file directly into the process address space for fast random-access reads. The project distinguishes itself through a multi-version concurrency control architecture that allows multiple simultaneous readers to access a consistent snapshot of data without blocking a writer. It employs a single-writer multi-reader locking model and uses a
Go
View on GitHub14,642
nutsdb/nutsdb
nutsdb/nutsdb
3,554View on GitHub
NutsDB is an ACID-compliant, embedded transactional storage engine that functions as both a disk-backed key-value store and an in-memory data structure store. It provides atomic and serializable transactions with commit and rollback capabilities to ensure strict data consistency for applications requiring a lightweight persistence layer. The engine distinguishes itself by supporting a variety of complex data types, including lists, sets, and sorted sets, alongside standard byte-slice storage. It implements a transactional storage model featuring hot backups and a compaction algorithm to maint
Godata-structuresdatabasego
View on GitHub3,554
etcd-io/bbolt
etcd-io/bbolt
9,573View on GitHub
bbolt is an ACID-compliant embedded key-value store for Go applications. It persists all data in a single memory-mapped file on disk, organizing information using B+ trees to facilitate sorted key iteration and efficient range queries. The project distinguishes itself through a hierarchical data organization model, allowing buckets to be nested within other buckets to create a tree-like structure. It employs a single-writer, multi-reader locking mechanism and copy-on-write transactions to ensure serializable isolation and data integrity. The system includes comprehensive data management capa
Go
View on GitHub9,573
dgraph-io/badger
dgraph-io/badger
15,666View on GitHub
Badger is an embeddable key-value store written in Go that provides persistent data storage for byte keys and values. It is a persistent database that utilizes a tiered LSM tree storage model to optimize disk storage and retrieval efficiency. The system features an ACID transaction engine that ensures data integrity through serializable snapshot isolation and multi-version concurrency control. It also provides an encrypted key-value store with data-at-rest encryption and a managed encrypted key registry to secure stored information. The engine covers a broad set of capabilities including hig
Godatabasedocument-databasego
View on GitHub15,666

See all 30 alternatives to Redb

cbernerredb

Features

Open-source alternatives to Redb

boltdb/bolt

nutsdb/nutsdb

etcd-io/bbolt

dgraph-io/badger

Star history

Open-source alternatives to Redb

boltdb/bolt

nutsdb/nutsdb

etcd-io/bbolt

dgraph-io/badger