IMPLEMENTASI ALGORITMA HUFFMAN DALAM KOMPRESI DATA PADA DATABASE

RIDWAN WULIDA SIAM, NIM. 14650024 (2018) IMPLEMENTASI ALGORITMA HUFFMAN DALAM KOMPRESI DATA PADA DATABASE. Skripsi thesis, UIN SUNAN KALIJAGA YOGYAKARTA.

Preview	Text (IMPLEMENTASI ALGORITMA HUFFMAN DALAM KOMPRESI DATA PADA DATABASE) 14650024_BAB-I_V_DAFTAR-PUSTAKA.pdf Download (5MB) | Preview
	Text (IMPLEMENTASI ALGORITMA HUFFMAN DALAM KOMPRESI DATA PADA DATABASE) 14650024_BAB-II_SAMPAI_BAB-IV.pdf Restricted to Registered users only Download (3MB)

Abstract

Technological developments are getting faster and faster, resulting in a lot of digital data stored in a storage medium. Especially if the data is then stored in an unspecified time. So the amount of storage media needed to accommodate the data. One way to solve it is to compress the data until its size becomes smaller. The huffman algorithm is one of the best text data compression algorithms. But in this huffman algorithm there are several weaknesses, among others, in the formation of trees. In this study offers the concept of huffman algorithm with two pieces of trees. Which means it can cut half of the formation of a huffman tree. By using two huffman trees in the formation of trees especially the prefix code will become shorter. Of course, in the application of huffman data compression in a program will take up more memory and time due to additional processes before the data is stored or displayed.

Share this knowledge with your friends :

Actions (login required)

View Item