https://github.com/spiraldb/fsst

Pure-Rust implementation of Fast Static Symbol Tables string compression
https://github.com/spiraldb/fsst

Last synced: 3 months ago
JSON representation

Pure-Rust implementation of Fast Static Symbol Tables string compression

• Host: GitHub
• URL: https://github.com/spiraldb/fsst
• Owner: spiraldb
• License: apache-2.0
• Created: 2024-08-08T16:11:22.000Z (almost 2 years ago)
• Default Branch: develop
• Last Pushed: 2026-03-25T17:47:25.000Z (3 months ago)
• Last Synced: 2026-03-25T19:45:01.336Z (3 months ago)
• Language: Rust
• Homepage:
• Size: 525 KB
• Stars: 209
• Watchers: 3
• Forks: 19
• Open Issues: 6
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

          


  



![Crates.io Version](https://img.shields.io/crates/v/fsst_rs)

![docs.rs](https://img.shields.io/docsrs/fsst-rs)

![GitHub Actions Workflow Status](https://img.shields.io/github/actions/workflow/status/spiraldb/fsst/ci.yml?branch=develop)

# fsst-rs

A pure-Rust, zero-dependency implementation of the [FSST string compression algorithm][whitepaper].

FSST is a string compression algorithm meant for use in database systems. It was designed by

[Peter Boncz, Thomas Neumann, and Viktor Leis][whitepaper]. 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.**

[whitepaper]: https://www.vldb.org/pvldb/vol13/p2649-boncz.pdf

[MIT-licensed implementation]: https://github.com/cwida/fsst