Data compression symmetry
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.
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.
|This article does not cite any references or sources. (February 2009)|
Further reading 
- Peter D. Symes (2004). "Symmetric and Asymetric Systems". Digital Video Compression. McGraw-Hill Professional. p. 11. ISBN 0-07-142487-3. More than one of
- David Salomon (2008). A Concise Introduction to Data Compression. Springer. pp. 15–16. ISBN 1-84800-071-5. More than one of
|This computing article is a stub. You can help Wikipedia by expanding it.|