LZ4 (compression algorithm)
| Original author(s) | Yann Collet |
|---|---|
| Developer(s) | Yann Collet |
| Initial release | April 24, 2011 |
| Stable release | r118 / June 27, 2014 |
| Development status | Active |
| Written in | C |
| Platform | Portable |
| Type | Data compression |
| License | New BSD |
| Website | http://code.google.com/p/lz4/ |
LZ4 is a lossless data compression algorithm that is focused on compression and decompression speed. It belongs to the LZ77 family of byte-oriented compression schemes.
Features
The algorithm gives a slightly worse compression ratio than the LZO algorithm – which in turn is worse than algorithms like gzip. However, compression speeds are similar to LZO, and several times faster than other algorithms while decompression speeds can be up to three times that of LZO.[1] [2] In a worst-case scenario, incompressible data gets increased by 0.4%.[3]
Design
The LZ4 algorithm represents the data as a series of sequences. Each sequence begins with a one byte token that is broken into two 4 bit fields. The first field represents the number of literal bytes that are to be copied to the output. The second field represents the number of bytes to copy from the already decoded output buffer (with 0 representing the minimum match length of 4 bytes). A value of 15 in either of the bitfields indicates that the length is larger and there is an extra byte of data that is to be added to the length. A value of 255 in these extra bytes indicates that yet another byte to be added. Hence arbitrary lengths are represented by a series of extra bytes containing the value 255. After the string of literals comes the token and any extra bytes needed to indicate string length. This is followed by an offset that indicates how far back in the output buffer to begin copying. The extra bytes (if any) of the match-length come at the end of the sequence.[3]
Compression can be carried out in a stream or in blocks. Higher compression ratios can be achieved by investing more effort in finding the best matches. This results in both a smaller file and a faster decompression.
Implementation
The reference implementation in C by Yann Collet is licensed under a BSD license. There are ports and bindings in various languages like Java, C#, Python etc.[1] Databases like Hadoop use this algorithm for fast compression. LZ4 was also implemented natively in the Linux Kernel 3.11.[4]The FreeBSD, Illumos, ZFS on Linux, and ZFS-OSX implementations of the ZFS filesystem support the LZ4 algorithm for on-the-fly compression.[5][6][7][8]
External links
References
- ^ a b https://code.google.com/p/lz4/
- ^ http://www.phoronix.com/scan.php?page=news_item&px=MTI4NjM
- ^ a b http://fastcompression.blogspot.in/2011/05/lz4-explained.html
- ^ http://lwn.net/Articles/557814/
- ^ http://www.freebsd.org/releases/9.2R/relnotes.html
- ^ http://wiki.illumos.org/display/illumos/LZ4+Compression
- ^ https://github.com/zfsonlinux/zfs/commit/9759c60
- ^ http://www.open-zfs.org/wiki/Features#lz4_compression
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
