Skip to content
/ GrofDB Public

Low latency kv store for fast concurrent ops

Notifications You must be signed in to change notification settings

Grofs/GrofDB

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

41 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

GrofDB ๐ŸŒŸ

GrofDB is an acronym for low latency key value database. Filesystems are major considerations during system designs of any kind. Proper handling of files and data either through Relational database management systems, NoSQL Databases or even Key-Value stores cannot be overemphasized. GrofDB is a network available key value store database that is built based on the design principles of Log Structured Merge Trees in this project my approach conveys a wholistic and Lean structure. GrofDB is designed to solve some of the issues traditional operating systems face in File systems modules which are high latency and high memory usages and sometimes Runtime complexities.

Table of Contents

  1. Description
  2. Features
  3. Prerequisites
  4. Installation
  5. Usage
  6. Make Usage
  7. Endpoints
  8. Notes

Description

GrofDB is a network available key value store database that is built based on the design principles of Log Structured Merge Trees which can be incorporated in any system to serve as a datastore. GrofDB provides low latency during writes and reads operations on any system it is incorporated on. it also provides a fault tolerant system which helps to preserve data incase of unforseen circumstances or a system crash. GrofDB pays attention to the ACID properties of database engineering to enhance data safety and durability, It also uses algorithms like Quicksort (efficient for sorting large datasets), Binary search and Log Merge trees for internal file operations.

Key Highlights:

  • Problem it solves: High Latency and High Memory utilisation issues in mordern Database systems
  • Where can it be used: Embedded systems Datastores, Web systems that require any form of Datastore etc.

Features

Feature Summary Status
๐ŸŒŸ Write Ahead Log Takes in data before sent to memtables โœ…
๐Ÿ“ In-Mem Disk Memtable Holds writes data request from server โœ…
โš™๏ธ Sorted Tables Memtables Flush on threshold limit to disk โœ…
๐Ÿš€ Data Recovery Replay mechanism done on WAL โŒ
๐Ÿ“ฎ Compaction for SSTables Merge multiple sstables for Memory optimization โŒ
๐Ÿ“Š Data Replication Data is split inside sstables and also in WAL โŒ
๐ŸŒ Network Availability Public endpoints exposed for end users โŒ

About

Low latency kv store for fast concurrent ops

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages