OptFSST lifts FSST's average compression factor by 7.3% and FSST12's by 17.0% across 92 string columns using DP encoding, triple counting, and pruning; it also proves the symbol-table selection problem is NP-hard when the alphabet is part of the input.
Patel, Andrew Pavlo, and Huanchen Zhang
1 Pith paper cite this work, alongside 6 external citations. Polarity classification is still indexing.
1
Pith paper citing it
6
external citations · OpenAlex
fields
cs.DB 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
OptFSST: Optimized FSST String Compression
OptFSST lifts FSST's average compression factor by 7.3% and FSST12's by 17.0% across 92 string columns using DP encoding, triple counting, and pruning; it also proves the symbol-table selection problem is NP-hard when the alphabet is part of the input.