The term data compression identifies reducing the number of bits of data that has to be stored or transmitted. You can do this with or without losing information, which means that what will be deleted throughout the compression will be either redundant data or unneeded one. When the data is uncompressed subsequently, in the first case the content and its quality will be identical, while in the second case the quality will be worse. There are various compression algorithms that are better for various kind of info. Compressing and uncompressing data normally takes plenty of processing time, therefore the server performing the action must have adequate resources in order to be able to process your info fast enough. A simple example how information can be compressed is to store just how many consecutive positions should have 1 and how many should have 0 inside the binary code as an alternative to storing the particular 1s and 0s.