To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

LZ4 (compression algorithm)

From Wikipedia, the free encyclopedia

Original author(s)Yann Collet
Developer(s)Yann Collet
Initial release24 April 2011 (2011-04-24)
Stable release
1.9.4[1] Edit this on Wikidata / 16 August 2022; 18 months ago (16 August 2022)
Repository
Written inC
Operating systemCross-platform
PlatformPortable
TypeData compression
LicenseSimplified BSD License
Websitelz4.org Edit this at Wikidata

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.

YouTube Encyclopedic

  • 1/3
    Views:
    284 841
    36 155
    632
  • Elegant Compression in Text (The LZ 77 Method) - Computerphile
  • How Compression Algorithms Work
  • Deflate Compression Module Is A Quick Way To Improve WordPress Site Speed Using htaccess

Transcription

Features

The LZ4 algorithms aims to provide a good trade-off between speed and compression ratio. Typically, it has a smaller (i.e., worse) compression ratio than the similar LZO algorithm, which in turn is worse than algorithms like DEFLATE. However, LZ4 compression speed is similar to LZO and several times faster than DEFLATE, while decompression speed is significantly faster than LZO.[3]

Design

LZ4 only uses a dictionary-matching stage (LZ77), and unlike other common compression algorithms does not combine it with an entropy coding stage (e.g. Huffman coding in DEFLATE).[4][5]

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 is 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.[6][7]

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 including Java, C#, Rust, and Python.[8] The Apache Hadoop system uses this algorithm for fast compression. LZ4 was also implemented natively in the Linux kernel 3.11.[9] The FreeBSD, Illumos, ZFS on Linux, and ZFS-OSX implementations of the ZFS filesystem support the LZ4 algorithm for on-the-fly compression.[10][11][12][13] Linux supports LZ4 for SquashFS since 3.19-rc1.[14] LZ4 is also supported in newer zstd command line utility by Yann Collet.

  • LZ4 available in extended 7zip-Version.[15]

References

  1. ^ "Release v1.9.4".
  2. ^ Collet, Yann. "LZ4 Frame Format Description". GitHub. Retrieved 7 October 2020.
  3. ^ Michael Larabel (28 January 2013). "Support For Compressing The Linux Kernel With LZ4". Phoronix. Retrieved 28 August 2015.
  4. ^ Collet, Yann (30 March 2019). "LZ4 Block Format Description". GitHub. Retrieved 9 July 2020. There is no entropy encoder back-end nor framing layer.
  5. ^ DEFLATE Compressed Data Format Specification version 1.3. IETF. doi:10.17487/RFC1951. RFC 1951. Retrieved 9 July 2020.
  6. ^ Yann Collet (26 May 2011). "RealTime Data Compression". Retrieved 28 August 2015.
  7. ^ ticki (25 October 2016). "How LZ4 works". Retrieved 29 June 2017.
  8. ^ Extremely Fast Compression algorithm http://www.lz4.org on GitHub
  9. ^ Jonathan Corbet (19 July 2013). "Kernel development". LWN.net. Retrieved 28 August 2015.
  10. ^ "FreeBSD 9.2-RELEASE Release Notes". FreeBSD. 13 November 2013. Retrieved 28 August 2015.
  11. ^ "LZ4 Compression". illumos. Archived from the original on 9 October 2018. Retrieved 28 August 2015.
  12. ^ Illumos #3035 LZ4 compression support in ZFS and GRUB on GitHub
  13. ^ "Features: lz4 compression". OpenZFS. Retrieved 28 August 2015.
  14. ^ Phillip Lougher (27 November 2014). "Squashfs: Add LZ4 compression configuration option". Retrieved 28 August 2015.
  15. ^ 7-zip-zstd

External links

This page was last edited on 12 February 2024, at 22:21
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.