#symbol-table #string #fsst #lz4 #database #system #zero-dependency

fsst-rs

Pure-Rust implementation of Fast Static Symbol Tables algorithm for string compression

12 releases (4 breaking)

0.4.4 Dec 30, 2024
0.4.3 Oct 3, 2024
0.4.2 Sep 17, 2024
0.3.0 Sep 3, 2024
0.0.1 Aug 15, 2024

#81 in Compression

Download history 212/week @ 2024-09-22 412/week @ 2024-09-29 160/week @ 2024-10-06 260/week @ 2024-10-13 76/week @ 2024-10-20 124/week @ 2024-10-27 739/week @ 2024-11-03 790/week @ 2024-11-10 1566/week @ 2024-11-17 562/week @ 2024-11-24 1094/week @ 2024-12-01 982/week @ 2024-12-08 1262/week @ 2024-12-15 150/week @ 2024-12-22 1354/week @ 2024-12-29 1830/week @ 2025-01-05

4,624 downloads per month
Used in 4 crates (2 directly)

Apache-2.0

240KB
942 lines

Crates.io Version docs.rs GitHub Actions Workflow Status

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.

No runtime deps