https://github.com/WyattJia/Pomegranate

🌳 A tiny skiplist based log-structured merge-tree written in Rust.
https://github.com/WyattJia/Pomegranate

kv kvstore lsm lsm-tree rust skiplist storage

Last synced: about 1 year ago
JSON representation

🌳 A tiny skiplist based log-structured merge-tree written in Rust.

• Host: GitHub
• URL: https://github.com/WyattJia/Pomegranate
• Owner: WyattJia
• License: mit
• Created: 2020-06-07T14:30:36.000Z (about 6 years ago)
• Default Branch: develop
• Last Pushed: 2023-12-21T16:04:26.000Z (over 2 years ago)
• Last Synced: 2024-11-11T10:42:28.249Z (over 1 year ago)
• Topics: kv, kvstore, lsm, lsm-tree, rust, skiplist, storage
• Language: Rust
• Homepage:
• Size: 5.07 MB
• Stars: 26
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
![](./image/pomegranate.jpg)

# Pomegranate(石榴)

[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)

![travis-ci](https://travis-ci.com/wellls/Pomegranate.svg?branch=develop)

Pomegranate is a tiny and fast log-structured merge-tree written in Rust.

**Pomegranate is still under development.**

## Why Rust?

Because Rust is a memory-safe, concurrency-friendly, high-performance programming language, and it also has rich and modern language features.

Based on its feature, I think it is very suitable for the development of storage application.

## Design

#### Memory Buffer

The memory buffer consists of *R* runs. In the slsm, one run corresponds to one skiplsit.

Only one *run* is activate at any time.

#### Skiplist

Skiplists are probabilistic data structures that provide for fast search within an orderedsequence of values. ey are composed of decreasingly sparse sorted runs of values thatare set in parallel, so that a search consists of searching a run until a key is found that isgreater than the desired one, then repeating the same process on the next-densest run,until the correct key is found.

#### Memory Buffer Index

Bloom lters nd important use in the sLSM when pairedone-to-one with runs in memory and on disk.

#### Disk Storage 

The disk-backed store is for more permanent storage and is only touched by merges fromthe memory buffer. ere areLdisk levels, each withDruns on each level. A run isan immutable sequence of sorted key-value pairs, and is captured within one memory-mapped le on disk.

## How to run

*Note: before you run, you should install Rust and Cargo first.*

```bash

git clone https://github.com/wellls/Pomegranate.git

cd /path/to/Pomegranate

cargo build

```

## Reference

* [Log-structured merge-tree](https://en.wikipedia.org/wiki/Log-structured_merge-tree)

* [The Skiplist-Based LSM Tree](https://arxiv.org/pdf/1809.03261.pdf)

* [Rust-lang](https://www.rust-lang.org/)