|
|
|
|
|
by emn13
3645 days ago
|
|
The two benchmarks you mention aren't very useful for comparing brotli and zstd, because they deal with large datasets. Per-call overhead matters a lot for small files, and I imagine (particularly brotli) is aimed at small files. Zstd (usefully!) calls out dictionary compression, which hints that small files matter for it too, but I'm not positive there's any specific use case for zstd in mind. In any case, neither the compression ratios nor the speed of large-file compression necessarily say much about small file performance. There's just much more context to search in a 100MB file than there is in a 10KB file. Having said that, there's no reason to assume brotli is better for small files; there's just no way to tell given the links you provide. I'm not affiliated with nor use neither zstd nor brotli. |
|