Implements a Sparse Merkle tree for a key-value store. 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.
Advanced persistent storage layer with MVCC, LSM-Tree, and Merkle DAG
Internal LevelDB-style snapshot list for bitcoin-rs: a raw-pointer-based doubly-linked list maintaining immutable database snapshots ordered by sequence number.
Pure Rust port of Cardano's LSM tree for blockchain indexing
A lsm-tree key-value store for async-tokio and io_uring-I/O on Linux
Core storage engine for Alopex DB - LSM-tree, columnar storage, and vector index
LSMTree based storage engine
A dynamo-like key/value database written in rust
Highly optimized approximate membership query filters (bloom, cuckoo, xor, quotient) with SIMD support
submillisecond.com cookbook recipe - storage: subms-lsm-tree. A working LSM tree (memtable, immutable SSTables, bloom-filter trailer) with sub-millisecond reads at p99 on a 50k-entry workload.
No description provided.
No description provided.
No description provided.
No description provided.