tiny-lsm
| Crates.io | tiny-lsm |
| lib.rs | tiny-lsm |
| version | 0.4.6 |
| source | src |
| created_at | 2021-12-01 16:19:32.916987 |
| updated_at | 2022-04-21 17:52:47.012657 |
| description | a dead-simple in-memory blocking LSM tree for constant-sized keys and values |
| homepage | |
| repository | https://github.com/spacejam/tiny-lsm |
| max_upload_size | |
| id | 490326 |
| size | 91,757 |
Tyler Neely (spacejam)
documentation
https://docs.rs/tiny-lsm/
README
tiny-lsm
Super simple in-memory blocking LSM for constant-size keys and values.
Despite being single-threaded and blocking, this is still capable of outperforming a wide range of other storage systems.
This is a great choice when you:
- want to fit the whole data set in-memory
- can model your keys and values in a bounded number of bytes
Tested with fuzzcheck, and the API and internals are intentionally being kept minimal to reduce bugs and improve performance for the use cases that this works well for.
Pairs extremely well with the zerocopy crate for viewing the fixed size byte arrays as typed data without paying expensive deserialization costs.