This article discusses the most common data compression algorithms , compares them and stresses the main advantages and weaknesses. Briefly describes the main principles of each algorithm. Examples of software and technologies which are based on them are given. The conclusion about the expedience of using the modified method of Huffman for compression of text values in the database are drawn.
data compression, LZ77, Huffman, Shannon–Fano, PPM, RLE, archives, coding
"Ohliad ta porivnialnyi analiz metodiv stysnennia informatsii" ,
Information Processing Systems,