LZ4 (compression algorithm)

LZ4 (compression algorithm)
Original author(s) Yann Collet
Developer(s) Yann Collet
Initial release April 24, 2011 (2011-04-24)
Stable release r131 / June 29, 2015 (2015-06-29)
Development status Active
Written in C
Operating system Cross-platform
Platform Portable
Type Data compression
License New BSD
Website www.lz4.org

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 gzip while decompression speeds can be significantly faster than LZO.[1]

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. The string of literals comes after 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.[2]

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 output and 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.[3] 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] Linux supports LZ4 for SquashFS since 3.19-rc1.[9]

References

  1. ↑ Michael Larabel (2013-01-28). "Support For Compressing The Linux Kernel With LZ4". Phoronix. Retrieved 2015-08-28.
  2. ↑ Yann Collet (2011-05-26). "RealTime Data Compression". Retrieved 2015-08-28.
  3. ↑ Extremely Fast Compression algorithm http://www.lz4.org on GitHub
  4. ↑ Jonathan Corbet (2013-07-19). "Kernel development". LWN.net. Retrieved 2015-08-28.
  5. ↑ "FreeBSD 9.2-RELEASE Release Notes". FreeBSD. 2013-11-13. Retrieved 2015-08-28.
  6. ↑ "LZ4 Compression". illumos. Retrieved 2015-08-28.
  7. ↑ Illumos #3035 LZ4 compression support in ZFS and GRUB on GitHub
  8. ↑ "Features: lz4 compression". OpenZFS. Retrieved 2015-08-28.
  9. ↑ Phillip Lougher (2014-11-27). "Squashfs: Add LZ4 compression configuration option". Retrieved 2015-08-28.

External links

This article is issued from Wikipedia - version of the Thursday, April 14, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.