Data compression symmetry
![]() | The topic of this article may not meet Wikipedia's general notability guideline. |
It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Find sources: "Data compression symmetry" – news · newspapers · books · scholar · JSTOR Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|Data compression symmetry|concern=no indication of [[Wikipedia:Notability|notability]] and, without references, how does one know if this exists?}} ~~~~ Timestamp: 20090212062713 06:27, 12 February 2009 (UTC) Administrators: delete |
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 decompress 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 it 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.