talent-plan/tinykv
Tinykv
TinyKV is a distributed key-value store designed for storing and retrieving data across multiple nodes with high availability. It functions as a distributed database system that incorporates a dedicated key-value storage engine for raw data persistence and retrieval on individual nodes.
The project includes a Raft consensus engine to ensure data consistency and fault tolerance across a cluster of servers. It also features a distributed transaction manager that coordinates atomic commits and concurrency control to maintain data integrity across shards.
The system covers cluster membership management, including leadership elections and data sharding to balance loads. It implements distributed transaction management and a replication-based consensus engine to maintain state stability.
Features
- Distributed Key-Value Stores - Provides a distributed key-value store for high-availability data storage and retrieval across multiple nodes.
- Consensus Engines - Features a dedicated consensus engine to maintain fault tolerance and state consistency across the cluster.
- Distributed Atomic Transactions - Coordinates distributed atomic transactions to ensure data integrity across multiple database shards.
- Storage Engines - Incorporates a low-level storage engine for raw data persistence and retrieval on individual nodes.
- Standalone Servers - Provides a standalone key-value store with a dedicated storage engine and request handlers.
- Log-Structured Merge-Trees - Uses a Log-Structured Merge-Tree storage engine to optimize write throughput via sequential disk operations.
- Raft Consensus Implementations - Implements the Raft consensus protocol to ensure consistent state replication and leader election.
- Distributed Transaction Coordinators - Ships a distributed transaction manager to coordinate atomic commits and concurrency control.
- Distributed Transaction Management - Implements distributed transaction management using concurrency control and atomic commit protocols.
- Cluster Range Partitioning - Organizes the keyspace into contiguous ranges assigned across nodes to balance data loads.
- Cluster Load Balancing - Balances load and maintains stability by redistributing data shards and managing leader elections.
- Dynamic Cluster Membership Management - Manages dynamic cluster membership including leadership changes and data sharding.
- Optimistic Concurrency Control - Employs optimistic concurrency control to manage parallel transactions and verify conflicts during commit.
- Node Failure Detection - Implements heartbeat-based monitoring to detect node failures and trigger leader elections.
- Two-Phase Commit Protocols - Provides a two-phase commit protocol to guarantee atomic transactions across distributed shards.
