Data compression symmetry

Symmetry and asymmetry, in the context of data compression, refer to the time relation between compression and decompression for a given compression algorithm.

If an algorithm takes the same time to compress a data archive as it does to decompress it, it is considered symmetrical. Note that compression and decompression, even for a symmetric algorithm, may not be perfectly symmetric in practice, depending on the devices the data is being copied to and from, and other factors such as latency and the fragmentation on the device.

In turn, if the compression and decompression times of an algorithm are vastly different, it is considered asymmetrical.

## Examples

Symmetric algorithms are typically used for media streaming protocols, as either the server taking too long to compress the data, or the client taking too long to decompress, would lead to delays in the viewing of the data.

Asymmetrical algorithms wherein the compression is faster than the decompression can be useful for backing up or archiving data, as in these cases data is typically much more often stored than retrieved.

## References

## Further reading

* Peter D. Symes (2004). "Symmetric and Asymetric Systems". Digital Video Compression. McGraw-Hill Professional. pp. 11. ISBN 9780071424875. https://archive.org/details/isbn_9780071424875/page/11.
* David Salomon (2008). A Concise Introduction to Data Compression. Springer. pp. 15-16. ISBN 9781848000711. https://archive.org/details/conciseintroduct00salo_179.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Data compression symmetry. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Data_compression_symmetry&oldid=64247"