LZ4 is a lossless data compression algorithm optimized for fast compression and decompression. It belongs to the LZ77 family of byte-oriented compression schemes and offers a trade-off between speed and ratio: its compression ratio is typically worse than the similar LZO algorithm, which is in turn worse than algorithms such as DEFLATE, but its compression speed is similar to LZO and several times faster than DEFLATE, and its decompression is significantly faster than LZO. Unlike many common compressors, LZ4 uses only a dictionary-matching stage and does not add an entropy coding stage such as Huffman coding. Data is written as a series of sequences, each beginning with a one-byte token split into two 4-bit fields that give the number of literal bytes to copy and the length of the match to copy from already decoded output, followed by the literals and an offset back into the output buffer. The reference implementation in C is by Yann Collet under a BSD license, and LZ4 is used by Apache Hadoop, natively in the Linux kernel since version 3.11, and in several ZFS implementations.
Connections
Credited To
Source LZ4 (compression algorithm) (Wikipedia)
In Field
Source LZ4 (compression algorithm) (Wikipedia)
Sources
LZ4 (compression algorithm) (Wikipedia)
In Group: Data Compression Algorithms, Lead
LZ4 is a lossless data compression algorithm optimized for fast compression and decompression.
In Field: Algorithms and Complexity Theory, Lead
LZ4 is a lossless data compression algorithm optimized for fast compression and decompression.
Credited To: Yann Collet, Implementation
The reference implementation in C by Yann Collet is licensed under a BSD license.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.