Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
terrelln
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
13 ms
·
121.
▲
by
terrelln
9y ago
We intend to improve the interaction of multithreaded compression and long range mode in a future release, as they go hand in hand. We also intend to support mmap in the CLI, which should help reduce the memory usage for very large window s
122.
▲
by
terrelln
9y ago
It was relicensed in v1.3.1. It is now dual licensed under BSD without the patents clause [1] and GPLv2 [2]. GPLv2 was added for inclusion in the Linux kernel. [1] https://github.com/facebook/zstd/blob/dev
123.
▲
by
terrelln
9y ago
Zstd recently added a long range mode that can find matches up to 2 GB in the past using a specialized algorithm [1]. It can be enabled on the command line with `zstd --long` for a 128 MB window, or `--long=windowLog` for a `2^windowLog` by
124.
▲
by
terrelln
9y ago
lz4 and zstd are complementary, not competitive. lz4 targets applications where extremely fast decompression speed (and compression speed) are required, at the expense of compression ratio. However, many applications would prefer to spend a
125.
▲
by
terrelln
9y ago
lrzip is a preprocessor that finds matches in the distant past that the backend compressor (xz) couldn't normally find. zstd has a new long range matcher mode inspired by the ideas behind rzip/lrzip with some extra tricks. It prod
126.
▲
Zstandard long range match finder
(github.com)
1 points
by
terrelln
9y ago
|
0 comments
127.
▲
Zstandard long range match finder
(github.com)
2 points
by
terrelln
9y ago
|
0 comments
128.
▲
Btrfs Zstd Support Coming to Linux 4.14
(phoronix.com)
3 points
by
terrelln
9y ago
|
0 comments
129.
▲
by
terrelln
9y ago
zstd uses ANS [1][2] to encode its (literal length, match length, offset) triples. [1] https://github.com/Cyan4973/FiniteStateEntropy [2] https://github.com/facebook/zstd/blob/dev/do
130.
▲
by
terrelln
10y ago
How are you compressing the data? I would expect a dictionary to be useful if the data is broken into chunks, and each chunk is compressed individually. If the data is compressed as one frame, I would be very interested in an example where
131.
▲
by
terrelln
10y ago
What use case do you have in mind for packaging dictionaries with archives? There is an ongoing discussion about a jump table format that could contain dictionary locations [1]. [1] https://github.com/facebook/zstd/