compression_text
Compression algos
Compression bandwidth
Measures the compression bandwidth (bytes/second) on the dickens.txt of the Silesia corpusSilesia corpusA set of 12 files, ~211 MB in total, compiled by Sebastian Deorowicz at the Silesian University of Technology to test lossless compression on a mix of data types: text, executables, databases, images, and XML. Its dickens file holds the collected works of Charles Dickens, ~10 MB of English text.Silesia corpusGlossary (10 MB uncompressed) using various algorithms, compression levels and other extra arguments.
Benchmark details
- Benchmark ID
compression_text:compress- Unit of measurement
- Bytes per second (Bps)
- Server types evaluated
- 3,643
- Total measurements
- 195,310
- Range of measurements
- 74.2K – 68G Bps
- Better
- ↑ Higher is better
Configuration options
| Field | Description | Example values |
|---|---|---|
algo | Compression algorithm, e.g. brotlibrotliA lossless compression format by Google, standardized in RFC 7932. It combines LZ77-style matching, Huffman coding, and context modeling with a built-in dictionary of common web text, and is widely used to compress HTTP responses. Its quality levels range from 0 (fastest) to 11 (smallest output).RFC 7932Glossary or bz2. | brotli bzip2bzip2A lossless file compressor by Julian Seward, first released in 1996. It sorts each block of data with the Burrows-Wheeler transform, then encodes it with move-to-front and Huffman coding. It usually compresses better than gzip but runs slower; its levels 1 to 9 set the block size from 100 to 900 kB.bzip2Glossary bzip3bzip3A lossless compressor by Kamila Szewczyk that, like bzip2, is built on the Burrows-Wheeler transform, combined with context modeling. It typically compresses text better than bzip2, and its configurable block size trades memory use for compression ratio.bzip3 on GitHubGlossary gzipgzipA lossless file compressor of the GNU Project, first released in 1992, and its file format, specified in RFC 1952. It uses the DEFLATE algorithm, which combines LZ77 matching and Huffman coding, and is the most widely supported compression format on Unix-like systems and the web. Its levels range from 1 (fastest) to 9 (smallest output).GNU gzipGlossary lz4lz4A lossless compression algorithm and format by Yann Collet from the LZ77 family, built for speed rather than compression ratio. It compresses and especially decompresses much faster than gzip, at a lower ratio; its higher levels use a slower high-compression mode that keeps decompression fast.LZ4Glossary lzma zpaqzpaqA lossless compressor and archive format by Matt Mahoney, based on context mixing, which predicts each bit from many models and combines their predictions. It reaches very high compression ratios, but compresses and decompresses slowly, at about the same speed in both directions. Its methods range from 1 (fastest) to 5 (smallest output).ZPAQGlossary zstd |
cores | Single-Core or Multi-Core compression tests. | multi single |
block_size | Block size | 65536 1048576 4194304 67108864 |
compression_level | Compression level/quality/level. | 0 1 3 4 5 6 7 8 9 11 12 14 16 22 |
Score distribution (195,310 measurements)
Decompression bandwidth
Measures the decompression bandwidth (bytes/second) on the compressed dickens.txt of the Silesia corpusSilesia corpusA set of 12 files, ~211 MB in total, compiled by Sebastian Deorowicz at the Silesian University of Technology to test lossless compression on a mix of data types: text, executables, databases, images, and XML. Its dickens file holds the collected works of Charles Dickens, ~10 MB of English text.Silesia corpusGlossary (10 MB uncompressed) using various algorithms, compression levels and other extra arguments.
Benchmark details
- Benchmark ID
compression_text:decompress- Unit of measurement
- Bytes per second (Bps)
- Server types evaluated
- 3,643
- Total measurements
- 195,310
- Range of measurements
- 74.1K – 254.2G Bps
- Better
- ↑ Higher is better
Configuration options
| Field | Description | Example values |
|---|---|---|
algo | Compression algorithm, e.g. brotlibrotliA lossless compression format by Google, standardized in RFC 7932. It combines LZ77-style matching, Huffman coding, and context modeling with a built-in dictionary of common web text, and is widely used to compress HTTP responses. Its quality levels range from 0 (fastest) to 11 (smallest output).RFC 7932Glossary or bz2. | brotli bzip2bzip2A lossless file compressor by Julian Seward, first released in 1996. It sorts each block of data with the Burrows-Wheeler transform, then encodes it with move-to-front and Huffman coding. It usually compresses better than gzip but runs slower; its levels 1 to 9 set the block size from 100 to 900 kB.bzip2Glossary bzip3bzip3A lossless compressor by Kamila Szewczyk that, like bzip2, is built on the Burrows-Wheeler transform, combined with context modeling. It typically compresses text better than bzip2, and its configurable block size trades memory use for compression ratio.bzip3 on GitHubGlossary gzipgzipA lossless file compressor of the GNU Project, first released in 1992, and its file format, specified in RFC 1952. It uses the DEFLATE algorithm, which combines LZ77 matching and Huffman coding, and is the most widely supported compression format on Unix-like systems and the web. Its levels range from 1 (fastest) to 9 (smallest output).GNU gzipGlossary lz4lz4A lossless compression algorithm and format by Yann Collet from the LZ77 family, built for speed rather than compression ratio. It compresses and especially decompresses much faster than gzip, at a lower ratio; its higher levels use a slower high-compression mode that keeps decompression fast.LZ4Glossary lzma zpaqzpaqA lossless compressor and archive format by Matt Mahoney, based on context mixing, which predicts each bit from many models and combines their predictions. It reaches very high compression ratios, but compresses and decompresses slowly, at about the same speed in both directions. Its methods range from 1 (fastest) to 5 (smallest output).ZPAQGlossary zstd |
cores | Single-Core or Multi-Core compression tests. | multi single |
block_size | Block size | 65536 1048576 4194304 67108864 |
compression_level | Compression level/quality/level. | 0 1 3 4 5 6 7 8 9 11 12 14 16 22 |
Score distribution (195,310 measurements)
Compression ratio
Measures the compression ratiocompression ratioA measure of how much a compressor shrinks data, from the sizes of the uncompressed and the compressed data. It is most often given as uncompressed size divided by compressed size, where higher is better, but some tools report compressed size divided by uncompressed size as a percentage, where lower is better.WikipediaGlossary while compressing the dickens.txt of the Silesia corpusSilesia corpusA set of 12 files, ~211 MB in total, compiled by Sebastian Deorowicz at the Silesian University of Technology to test lossless compression on a mix of data types: text, executables, databases, images, and XML. Its dickens file holds the collected works of Charles Dickens, ~10 MB of English text.Silesia corpusGlossary (10 MB uncompressed) using various algorithms, compression levels and other extra arguments.
Benchmark details
- Benchmark ID
compression_text:ratio- Unit of measurement
- —
- Server types evaluated
- 3,643
- Total measurements
- 195,310
- Range of measurements
- 21 – 63.1
- Better
- ↓ Lower is better
Configuration options
| Field | Description | Example values |
|---|---|---|
algo | Compression algorithm, e.g. brotlibrotliA lossless compression format by Google, standardized in RFC 7932. It combines LZ77-style matching, Huffman coding, and context modeling with a built-in dictionary of common web text, and is widely used to compress HTTP responses. Its quality levels range from 0 (fastest) to 11 (smallest output).RFC 7932Glossary or bz2. | brotli bzip2bzip2A lossless file compressor by Julian Seward, first released in 1996. It sorts each block of data with the Burrows-Wheeler transform, then encodes it with move-to-front and Huffman coding. It usually compresses better than gzip but runs slower; its levels 1 to 9 set the block size from 100 to 900 kB.bzip2Glossary bzip3bzip3A lossless compressor by Kamila Szewczyk that, like bzip2, is built on the Burrows-Wheeler transform, combined with context modeling. It typically compresses text better than bzip2, and its configurable block size trades memory use for compression ratio.bzip3 on GitHubGlossary gzipgzipA lossless file compressor of the GNU Project, first released in 1992, and its file format, specified in RFC 1952. It uses the DEFLATE algorithm, which combines LZ77 matching and Huffman coding, and is the most widely supported compression format on Unix-like systems and the web. Its levels range from 1 (fastest) to 9 (smallest output).GNU gzipGlossary lz4lz4A lossless compression algorithm and format by Yann Collet from the LZ77 family, built for speed rather than compression ratio. It compresses and especially decompresses much faster than gzip, at a lower ratio; its higher levels use a slower high-compression mode that keeps decompression fast.LZ4Glossary lzma zpaqzpaqA lossless compressor and archive format by Matt Mahoney, based on context mixing, which predicts each bit from many models and combines their predictions. It reaches very high compression ratios, but compresses and decompresses slowly, at about the same speed in both directions. Its methods range from 1 (fastest) to 5 (smallest output).ZPAQGlossary zstd |
cores | Single-Core or Multi-Core compression tests. | multi single |
block_size | Block size | 65536 1048576 4194304 67108864 |
compression_level | Compression level/quality/level. | 0 1 3 4 5 6 7 8 9 11 12 14 16 22 |
Score distribution (195,310 measurements)