From fa2a1b86fadad44bf81931f3bf5b71c4b817d5a2 Mon Sep 17 00:00:00 2001 From: Andrew Duffy Date: Mon, 12 Aug 2024 17:57:03 -0400 Subject: [PATCH] words --- README.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 5f16b80..d6957db 100644 --- a/README.md +++ b/README.md @@ -6,7 +6,11 @@ FSST is a string compression algorithm meant for use in database systems. It was [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. -**NOTE**: This current implementation is still in-progress, please use at your own risk. +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.** [whitepaper]: https://www.vldb.org/pvldb/vol13/p2649-boncz.pdf +[MIT-licensed implementation]: https://github.com/cwida/fsst