Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression
The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the internet is increasing every day. That way no matter how big the size of the storage device we have, of course, it will only be a matter of t...
Gespeichert in:
| Veröffentlicht in: | IT journal research and development (Online) Jg. 7; H. 2; S. 155 - 169 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
30.12.2022
|
| ISSN: | 2528-4061, 2528-4061 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the internet is increasing every day. That way no matter how big the size of the storage device we have, of course, it will only be a matter of time until that storage space is exhausted. Therefore, in terms of maximizing storage space, a technique called compression emerged. This study focuses on a comparative analysis of 2 Lossless compression technique algorithms, namely the Huffman algorithm and Lempel Ziv Welch (LZW). A number of test files with different file types are applied to both algorithms that are compared. The performance of the algorithm is determined based on the comparison of space saving and compression time. The test results showed that the Lempel Ziv Welch (LZW) algorithm was superior to Huffman’s algorithm in .txt file type compression and .csv, the average space savings produced were 63.85% and 77.56%. The degree of compression speed that each algorithm produces is directly proportional to the file size. |
|---|---|
| AbstractList | The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the internet is increasing every day. That way no matter how big the size of the storage device we have, of course, it will only be a matter of time until that storage space is exhausted. Therefore, in terms of maximizing storage space, a technique called compression emerged. This study focuses on a comparative analysis of 2 Lossless compression technique algorithms, namely the Huffman algorithm and Lempel Ziv Welch (LZW). A number of test files with different file types are applied to both algorithms that are compared. The performance of the algorithm is determined based on the comparison of space saving and compression time. The test results showed that the Lempel Ziv Welch (LZW) algorithm was superior to Huffman’s algorithm in .txt file type compression and .csv, the average space savings produced were 63.85% and 77.56%. The degree of compression speed that each algorithm produces is directly proportional to the file size. |
| Author | Alif, Muhammad Prianto3, Cahyo Fauzan, Mohamad Nurkamal |
| Author_xml | – sequence: 1 givenname: Mohamad Nurkamal surname: Fauzan fullname: Fauzan, Mohamad Nurkamal – sequence: 2 givenname: Muhammad surname: Alif fullname: Alif, Muhammad – sequence: 3 givenname: Cahyo surname: Prianto3 fullname: Prianto3, Cahyo |
| BookMark | eNpNkNFKwzAYhYNMcM49gHd5gdYkbZPmchTnhII3hYE3JW3_uIw2KUkVfXu76sWuzoEPDofvHq2ss4DQIyUxy5iUT2Y6-y5mhCUxJWkibtB6BnmUEk5XV_0ObUM4E0KYJDKjZI2OhRtG5U1wFjuND59aD8riXf_hvJlOA1a2wyUMI_T43XzhI_Tt6Qobiyv4nvDe9IAvWx5CMM4-oFut-gDb_9ygav9cFYeofHt5LXZl1OaZiICwJmNadKpVkCoheKN1SoHPlGktu_lknspcUM2B55KzpGO8SURLKCRz2SD6N9t6F4IHXY_eDMr_1JTUi5t6cVNf3NSLm-QXYsxacA |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.25299/itjrd.2023.10437 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2528-4061 |
| EndPage | 169 |
| ExternalDocumentID | 10_25299_itjrd_2023_10437 |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ |
| ID | FETCH-LOGICAL-c857-e02b52f7dacae4a776bff41e6c852ff9d951849871f6e689623d26b37c01e36b3 |
| ISSN | 2528-4061 |
| IngestDate | Sat Nov 29 02:44:12 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://creativecommons.org/licenses/by-sa/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c857-e02b52f7dacae4a776bff41e6c852ff9d951849871f6e689623d26b37c01e36b3 |
| OpenAccessLink | https://journal.uir.ac.id/index.php/ITJRD/article/download/10437/4880 |
| PageCount | 15 |
| ParticipantIDs | crossref_primary_10_25299_itjrd_2023_10437 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-12-30 |
| PublicationDateYYYYMMDD | 2022-12-30 |
| PublicationDate_xml | – month: 12 year: 2022 text: 2022-12-30 day: 30 |
| PublicationDecade | 2020 |
| PublicationTitle | IT journal research and development (Online) |
| PublicationYear | 2022 |
| SSID | ssj0002909510 ssib051604815 |
| Score | 2.205207 |
| Snippet | The development of data storage hardware is very rapidly over time. In line with the development of storage hardware, the amount of digital data shared on the... |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 155 |
| Title | Comparison of Huffman Algorithm and Lempel Ziv Welch Algorithm in Text File Compression |
| Volume | 7 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2528-4061 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib051604815 issn: 2528-4061 databaseCode: M~E dateStart: 20160101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwgEOFU8BBeQDJ6LA2nk4Pq6qVkViKw6RWnGJkthmA8GpluyqcOj_6b9kbGezZgUSPXCJLDsZ7Wa-jMfj8TcIveaKVKngSViBAQ7jjMvQ1MMJFXgTmagSxsrYFptgp6fZ-Tn_OJlcb87CrFumdXZ5yS_-q6qhD5Rtjs7eQN2jUOiANigdrqB2uP6T4g_9yoLByUopE6aftZ-7ZdMvXEWMDxK85Tb41KyDM9nWC2-40UEOBjs4BnNhrYVLlNW-F_s-HxknBrIgdz5ObDOQdmlMB8bH1U8XcJ13i_JbKUyw4is0xjSPWdtYlsj5CsbhhtFyw4vTfRe5HJXFj86PVlBbOGXYeLFGjSYmmjd1BOxv5R_6BqvMPPBRz8ISx-o7TNbE1XnZnQdAIjc8qk3_ZWnoYGlk9rIdu8zvnNs7c-GYoQhrIyuksCIKI6KwIm6h25Ql3GQPzq-ONqYrIel0pL0xTgDl1nc1pQ03_87tqVup73Z_mOcVee5Nfh_tD-sSPHN4eoAmUj9E9zy2ykfobIss3Ck8IAuP0MEAAeyQhQFZ2CLLG240NsjCBlnYQ9ZjlB8f5Ycn4VCXI6wNcZic0iqhiomyLmVcMpZWSsVEpjBKleLw5ZMs5rASV6lMMw4OtqBpFbF6SmQEjSdoT3daPkUYvGFFoqSuVCRiUotMlILFAh6rMlZG9TP0ZvNaigvHvlL8VTPPb3LzAbq7hecLtNcvV_IlulOv--b78pXV7S_vcH00 |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Comparison+of+Huffman+Algorithm+and+Lempel+Ziv+Welch+Algorithm+in+Text+File+Compression&rft.jtitle=IT+journal+research+and+development+%28Online%29&rft.au=Fauzan%2C+Mohamad+Nurkamal&rft.au=Alif%2C+Muhammad&rft.au=Prianto3%2C+Cahyo&rft.date=2022-12-30&rft.issn=2528-4061&rft.eissn=2528-4061&rft.volume=7&rft.issue=2&rft.spage=155&rft.epage=169&rft_id=info:doi/10.25299%2Fitjrd.2023.10437&rft.externalDBID=n%2Fa&rft.externalDocID=10_25299_itjrd_2023_10437 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2528-4061&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2528-4061&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2528-4061&client=summon |