Predykcyjno-substytucyjna metoda kompresji danych w praktyce programowania

• Autorzy: Swacha J.

Warianty tytułu

EN

The predict1ve-substitutlonal data compression method in programming practice

• Języki publikacji: PL

Abstrakty

EN

Data compression is an art of reducing the quantity of transmitted and stored data. Its implementation in software helps to improve software usefulness. One of the most promising data compression methods is the predictive-substitutional. This paper discusses the circumstances that make it advisable to implement data compression in the software being developed, the ways to implement data compression, the most popular universal data compression methods, and the advantages of using the predictive-substitutional data compression method over other available solutions.

Słowa kluczowe

PL

kompresja danych; algorytm kompresji danych; oprogramowanie

• Wydawca: Wydawnictwo Naukowe Uniwersytetu Szczecińskiego
• Czasopismo: Zeszyty Naukowe. Studia Informatica / Uniwersytet Szczeciński
• Rocznik: 2006
• Tom: Nr 19
• Strony: 151--165
• Opis fizyczny: bibliogr. 19 poz., tab., wykr.

Twórcy

autor

Swacha J.

• Uniwersytet Szczeciński , Wydział Nauk Ekonomicznych i Zarządzania, Instytut Informatyki w Zarządzaniu, ul. Mickiewicza 64, 71-101 Szczecin

Bibliografia

• 1.J. Swacha: Popularne standardy kompresji danych. "Pro Dialog" 1999, nr 9, s.23-32.
• 2.P.M. Tolani, J.R. Haritsa: XGRIND: A Query-friendly XML. Compressor. haritsa@.serc.iisc.ernet.in.
• 3.J.R. Velasco, L.A. Velasco Lucianez: Benefits of Compression in HTTP Applied to caching Architectures. Proceedings of the Thrid International WWW Caching Workshop 1998.
• 4.InfoZIP Home page, http://www.info-zip.org/pub/infozip/.
• 5.M. Drinić, D. Kirovski: PPMexe: PPM for Compressing Software. Proc.IEEE Data Compression Conf. 2002.
• 6.K. Sayood: Kompresja danych - wprowadzenie. Wyd. RM, Warszawa 2002.
• 7.C.E. Shannon: A mathematical Theory of Communication. "Bell System Technical Journal" 1948, nr 27, s.379-423, 623-656.
• 8.D.A. Huffman: A Method for the Construction of Minimum-Redundancy Codes. "Proc. IRE" 1952, nr 40, 9 September, s.1098-1101.
• 9.R. Pasco: Source Coding Algorithms for Fast Data Compression. Rozprawa doktorska. Stanford University, Stanford 1976.
• 10.J.J. Rissanen: Generalized KraFT Inequality and Artihmetic Coding. "IBM Journal of Research and Development" 1976, 20 May, s. 198-203.
• 11.G.N.N. Martin: range Encoding . An Algotithm for Removing Redundancy from a Digitised Message. Presented to The Video & Data Recording Conference. Southampton 1979.
• 12.M. Schindler: Lassless data Compression. http://www.compressconsult.com/.
• 13.J.G. Cleary, I.H. Witten: data Compression Using Adaptive Coding and Partial String Matching. "IEE Transactions on Communications 1984, nr 32(4), s.396-402.
• 14.D. Shkarin: PPM One Step to Practicality. Proc. IEEE Data Compression Conf. 2002.
• 15.J. Ziv, A. Lempel: A Universal Algorithm for Sequential data Compression. "IEEE Trans. Inform.Theory" 1977, nr 23, 3 May, s.337-343.
• 16.J. Ziv, A. Lempel: Comprression of Individual Sequences via Variable-Rate Coding. "IEEE Trans. Inform. Theory" 1978, nr 24, 5 September, s. 530-536.
• 17.Z. Szyjewski, J. Swacha: A New method of Predictive-Substitutional Data Compression. Internet technologies Applications and Societal Impact. Kluwer Academic Publishers, Boston-Dordrecht-London 2002, s.123-134.
• 18.I. Witten, T. Bell, J. Cleary: Calgary Corpus. University of Calgary. Canada 1987. http://www..data-compression.info/Corpora/CalgaryCorpus/calgarycorpus.htm.
• 19.R. Arnold, T.C. Bell: A Corpus for the Evaluation of Lasseless Compression Algorithms. Proc.IEEE Data Compression Conference. Snowbird, UT 1997, s.2010210.