lsmtree

Sparse Merkle tree for a key-value map.

APACHE-2.0 License

Downloads

12K

Stars

20

Committers

View Code on GitHub View on X

Ecosystems: Rust

A Rust library that implements a Sparse Merkle tree for a key-value map. The tree implements the same optimisations specified in the Libra whitepaper, to reduce the number of hash operations required per tree operation to O(k) where k is the number of non-empty elements in the tree.

[English][en-url] | 简体中文

Installation

[dependencies]
lsmtree = "0.0.6"

License

lsmtree is under the terms of both the MIT license and the Apache License (Version 2.0).

See LICENSE-APACHE, LICENSE-MIT for details.

Copyright (c) 2022 Al Liu.

Package Rankings

Top 23.99% on Crates.io

Related Projects

valog

A lock-free, generic, lightweight value log for WiscKey or Bitcask architecture databases.

learn-rs

Getting started with Rust: resources, tools and code samples for learning Rust

rbtree-rs

The rbtree for Rust

crypto-hash

A Rust wrapper for OS-level cryptographic hash functions

aatree

AATree implementation in Rust

hashbrown

Rust port of Google's SwissTable hash map

28 Oct 2018 2,271

zeptohttpc

Proving ground for changes to attohttpc

caches-rs

This is a Rust implementation for popular caches (support no_std).

22 Aug 2021 104

among

The enum Among with variants Left, Middle and Right is a general purpose sum type with three cases.

skl

A lock-free thread-safe arena based Skiplist impelementation for building memtable.

betree

smartalloc-rs

Orphaned memory buffer detector

rs-merkletree

Rust Library to create Merkle Trees

merklez

Experimental Rust library for binary merkle trees

nthash

ntHash implementation in Rust