
| Latest release | 1.2.3 / 2005-07-18 |
|---|---|
| Written in | C |
| OS | cross platform |
| Type | data compression |
| License | zlib license |
| Website | zlib.net |
zlib is a software library used for data compression. zlib was written by Jean-Loup Gailly and Mark Adler and is an abstraction of the DEFLATE compression algorithm used in their gzip file compression program. The first public version, 0.9, was released on 1 May 1995 and was originally intended for use with libpng image library. It is free software, distributed under the zlib license.
As of March 2007, zlib is included in Coverity’s Department of Homeland Security-sponsored ongoing examination of select open-source projects.[1]
Contents |
Typically data is compressed using the zlib header as this provides error detection etc. When data is written without a header the result is raw DEFLATE data with no error detection and it is up to the caller of the decompression software to know where the compressed data ends.
The gzip header is larger than the zlib header as it stores a file name and other file system information - in fact this is the header format used in the ubiquitous gzip file format. Note that the zlib library cannot itself create a gzip file, but it is fairly trivial to do this by writing the compressed data to a file with a gzip header.
This algorithm provides good compression on a wide variety of data with minimal use of system resources. This is also the algorithm almost invariably use nowadays in ZIP (file format) (though the zip file format supports several other algorithms also).
It is unlikely that the zlib format will ever be extended to use any other algorithms, though the header makes allowance for this possibility.
A compression level value may be supplied which trades-off speed with compression.
There are also facilities for conserving memory. These are probably only useful in restricted memory environments such as some embedded systems.
If you are using the library to always compress specific types of data then using a specific strategy may improve compression and performance. For example, if your data contains long lengths of repeated bytes then the RLE (run-length encoding) strategy may give better results.
For general data, the default strategy is preferred.
Data corruption can be detected (as long as the data is written with a zlib or gzip header - see above).
Further, if full-flush points are written to the compressed stream then corrupt data can be skipped and the decompression will resynchronise at the next flush point. (No error recovery of the corrupt data is provided.) Full-flush points are useful for large data streams on unreliable channels where some last data loss is unimportant (eg multimedia), however creating too many flush points can dramatically affect speed and compression.
Repeated calls to the library allow an unlimited numbers of blocks of data to be handled. Some ancillary code (counters) may suffer from overflow for long data streams but this does not affect tha actual compression or decompression.
When compressing a long (or infinite) data stream it would be advisable to write regular full-flush points.
Today, zlib is something of a de facto standard, to the point that zlib and DEFLATE are often used interchangeably in standards documents. Thousands of applications rely on it for compression, directly or indirectly,[2] including:
zlib is also used in many embedded devices because the code is portable, liberally-licensed and has a relatively small memory footprint.
Why are we here?
All text is available under the terms of the GNU Free Documentation License
This page is cache of Wikipedia. History