Article Per Year (5 Year)
p-Index From 2019 - 2024
2.233
P-Index
This Author published in this journals
All Journal Format : Jurnal Imiah Teknik Informatika JURNAL TEKNIK INFORMATIKA DAN SISTEM INFORMASI Akrab Juara : Jurnal Ilmu-ilmu Sosial STUDI PELAKSANAAN SELFMEDICATION PADA PENDERITA DIARE BERDASARKAN TINGKAT PENGETAHUAN MASYARAKAT PESISIR KECAMATAN SOROPIA KABUPATEN KONAWE INSANtek – Jurnal Inovasi dan Sains Teknik Elektro Profitabilitas J-Intech (Journal of Information and Technology)
Harna Adianto
Universitas Bina Sarana Informatika
Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Engineering Health Professions Library & Information Science Medicine & Pharmacology Public Health

Published : 14 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : J-Intech (Journal of Information and Technology)

 1 
Komparasi Performa Algoritma Kompresi Data Lossless Menggunakan Rasio Kompresi Dan Penghematan Ruang Aswar Hanif; Endang Wahyudi; Harna Adianto; Lilik Martanto
J-INTECH (Journal of Information and Technology) Vol 11 No 1 (2023): J-Intech : Journal of Information and Technology
Publisher : LPPM STIKI MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32664/j-intech.v11i1.863

Abstract

Data growth is a sizeable challenge. The goal of data compression is to reduce the size of data needed to still represent useful information. Data compression can be used to increase the efficiency of data storage, transmission and protection. Lossless algorithms can precisely reconstruct the original data from the compressed data. Lossless compression is often used for data that needs to be stored or transmitted accurately. Several lossless compression methods and algorithms include the Lempel–Ziv–Markov chain algorithm (LZMA), Prediction by partial matching (PPM), Burrows-Wheeler block sorting text compression algorithm and Huffman coding (BZip2), and Deflate. Even though all compression systems are based on the same principles, there should still be differences in performance. Because of that, a general guide is needed to help determine the most appropriate data compression algorithm to use. This study aims to determine the data compression algorithm that has the best performance, based on a comparison using the Compression Ratio and Space Saving values. The research phase begins with determining the compression algorithm used, data preparation, performance testing, to then be discussed and conclusions drawn. The results show that the compression ratio and space savings that can be achieved specifically will depend on the data used. Although the range of average values of compression performance is not that big, in general LZMA2 shows the best results with a compression ratio of 1.457 and a space saving of 15.00%. Hopefully, the results of this test can be used as an overview in helping to choose a lossless data compression algorithm.
Co-Authors . Suwarsito Alvin Syahid Andihika Bramantiyo Sinabang Aswar Hanif Endang Wahyudi Endang Wahyudi Lilik Martanto Lilik Martanto Lilik Martanto Markus Lilik Martanto Martanto, Markus Lilik Martias Martias Niken Herawati Sergi Aryastian