super simple in-memory blocking LSM for constant-size keys and values
☆72Feb 21, 2025Updated last year
Alternatives and similar repositories for tiny-lsm
Users that are interested in tiny-lsm are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆41Aug 20, 2024Updated last year
- high-efficiency concurrent reclamation☆38Aug 29, 2024Updated last year
- Adaptive Radix Trie implementation for fixed-length keys☆54Jul 30, 2025Updated 7 months ago
- ☆12Aug 14, 2025Updated 7 months ago
- trigger io::Error's in test, and annotate their source☆31Aug 5, 2023Updated 2 years ago
- constant-size associative container backed by a simple array☆20Aug 6, 2023Updated 2 years ago
- scan-resistant concurrent lazy LRU☆63Aug 5, 2023Updated 2 years ago
- lock-free B+ tree☆311Sep 8, 2024Updated last year
- scraps of a potential language☆38Apr 9, 2021Updated 4 years ago
- speedy web micro-framework using sled, io_uring and SIMD☆13Feb 8, 2020Updated 6 years ago
- An experimental columnar arena☆43Feb 8, 2026Updated last month
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37May 16, 2022Updated 3 years ago
- Concurrently Readable Data Structures for Rust☆365Feb 10, 2026Updated last month
- A lightweight low-level single-threaded actor runtime☆186Jan 15, 2026Updated 2 months ago
- garbage-collecting on-disk object store, supporting higher level KV stores and databases.☆418Nov 4, 2025Updated 4 months ago
- Protobuf and gRPC service definition of treehole.space☆10Mar 27, 2022Updated 3 years ago
- bluss/IndexMap with amortized resizes☆14Dec 21, 2020Updated 5 years ago
- Modular, structure-aware, and feedback-driven fuzzing engine for Rust functions☆449Jan 22, 2026Updated 2 months ago
- ☆21Nov 26, 2022Updated 3 years ago
- An implementation of TinyLFU cache☆15Oct 10, 2022Updated 3 years ago
- Value log implementation for key-value separated storage in safe Rust☆44Sep 5, 2025Updated 6 months ago
- The TiKV development/contribution guide☆35Jul 20, 2022Updated 3 years ago
- A pure Rust database implementation using an append-only B-Tree file format.☆279Oct 11, 2023Updated 2 years ago
- `smol` integrations with `hyper`☆17Feb 16, 2026Updated last month
- Type-safe SQL query wrappers☆12Mar 18, 2022Updated 4 years ago
- Eliminating the need for hand-crafted assembly in high-performance interpreters☆14Mar 22, 2021Updated 5 years ago
- K.I.S.S. LSM-tree implementation in safe Rust☆377Mar 15, 2026Updated last week
- A low-level MVCC file format for storing blobs.☆65Mar 6, 2024Updated 2 years ago
- [Archive] An experimental cloud-native distributed KV engine for OLTP workload.☆72Dec 12, 2022Updated 3 years ago
- A standard Bloom Filter implementation☆24Aug 26, 2020Updated 5 years ago
- Don't look, I'm just playing with a B+-tree implementation which may or may not turn into a PALM tree.☆26Jul 19, 2020Updated 5 years ago
- safe bindings to io-uring☆683Jun 14, 2021Updated 4 years ago
- Proof-of-concept for a memory-efficient data structure for zooming billion-event traces☆73Jun 25, 2021Updated 4 years ago
- Multipurpose calculator with coalescing written in Rust☆22Dec 29, 2019Updated 6 years ago
- ☆47Sep 25, 2020Updated 5 years ago
- In short, mio is memcached + "range search".☆40Sep 16, 2010Updated 15 years ago
- Library to serialize and deserialize Syn syntax trees.☆27Mar 12, 2026Updated last week
- A strongly-typed document database that runs on any transactional key-value store.☆395Aug 23, 2022Updated 3 years ago
- JSON event parser is a simple streaming JSON parser and serializer implementation in Rust.☆14Mar 2, 2026Updated 3 weeks ago