The term data compression refers to lowering the number of bits of information which should be stored or transmitted. This can be achieved with or without the loss of information, so what will be erased at the time of the compression will be either redundant data or unnecessary one. When the data is uncompressed afterwards, in the first case the information and its quality will be the same, while in the second case the quality shall be worse. There are different compression algorithms which are more efficient for different type of data. Compressing and uncompressing data often takes lots of processing time, which means that the server performing the action needs to have ample resources in order to be able to process the data quick enough. An example how information can be compressed is to store just how many consecutive positions should have 1 and just how many should have 0 within the binary code instead of storing the actual 1s and 0s.