Perbandingan Algoritma Sequitur dan RLE Dalam Kompresi Teks
-
Rian Syahputra
*
Universitas Budi Darma, Medan,
Indonesia
(*) Corresponding Author
Abstract
Information on a news blog is not small if we look at the amount of information that will be conveyed in a news story. A news blog also uses a lot of storage memory in the database because of the large amount of information in the form of text that is stored, and also affects the speed of data transmission. Compression techniques aimed at reducing data can be used to reduce stored text and save storage media and speed up the data transmission process. Using the Sequitur algorithm is better with a compression ratio of 80.95% of the initial size, because the sequitur algorithm removes symbol pairs that appear more than once with a new symbol. While the RLE algorithm in this study cannot be used because it does not meet the RLE algorithm so that the compression process does not occur due to the absence of the same characters appearing successively, this is a weakness of the RLE algorithm
References
S. R. Saragih and D. P. Utomo, “Penarapan Algoritma Prefix Code Dalam Kompresi Data Teks,” KOMIK (Konferensi Nas. …, vol. 4, no. 1, pp. 249–252, 2020, doi: 10.30865/komik.v4i1.2691.
Y. Darnita, K. Khairunnisyah, and H. Mubarak, “Kompresi Data Teks Dengan Menggunakan Algoritma Sequitur,” Sistemasi, vol. 8, no. 1, p. 104, 2019, doi: 10.32520/stmsi.v8i1.429.
S. Siahaan, “Penerapan Algoritma Sequitur Pada Kompresi Record Database Pada Database,” JURIKOM (Jurnal Ris. Komputer), vol. 6, no. 5, pp. 511–516, 2019, [Online]. Available: https://www.ejurnal.stmik-budidarma.ac.id/index.php/jurikom/article/view/1644
U. Mansyuri, “KOMPRESI DATA TEKS DENGAN METODE RUN LENGTH ENCODING,” J. SIMASI, vol. 1, no. 2, pp. 102–109, 2021.
Herdianto, “Perbandingan Metode RLE dan Huffman dalam Kompresi Data Teks,” J. Ilm. Core It, vol. 9, no. 1, pp. 41–47, 2019.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Perbandingan Algoritma Sequitur dan RLE Dalam Kompresi Teks
Pages: 33-35
Copyright (c) 2022 Rian Syahputra
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
