fsst-rs
| Crates.io | fsst-rs |
| lib.rs | fsst-rs |
| version | 0.4.3 |
| source | src |
| created_at | 2024-08-15 17:58:09.353599 |
| updated_at | 2024-10-03 16:35:59.545343 |
| description | Pure-Rust implementation of Fast Static Symbol Tables algorithm for string compression |
| homepage | |
| repository | https://github.com/spiraldb/fsst |
| max_upload_size | |
| id | 1339068 |
| size | 340,359 |
crates.io (github:spiraldb:crates-io)
documentation
README
fsst-rs
A pure-Rust, zero-dependency implementation of the FSST string compression algorithm.
FSST is a string compression algorithm meant for use in database systems. It was designed by Peter Boncz, Thomas Neumann, and Viktor Leis. It provides 1-3GB/sec compression and decompression of strings at compression rates competitive with or better than LZ4.
This implementation is somewhat inspired by the MIT-licensed implementation from the paper authors, written in C++, but it is mostly written from a careful reading of the paper.
NOTE: This current implementation is still in-progress and is not production ready, please use at your own risk.
NOTE: This crate only works on little-endian architectures currently. There are no current plans to support big-endian targets.