透過您的圖書館登入
IP:3.22.181.81

並列摘要


With increasing amount of text data being stored rapidly, efficient information retrieval and Storage in the compressed domain has become a major concern. Compression is the process of coding that will effectively reduce the total number of bits needed to represent certain information. Data compression has been one of the critical enabling technologies for the ongoing digital multimedia revolution. There are lots of data compression algorithms which are available to compress files of different formats. This paper provides a survey of different basic lossless data compression algorithms on English text files: LZW, Huffman, Fixed-length code (FLC), and Huffman after using Fixed-length code (HFLC). All the above algorithms are evaluated and tested on different text files of different sizes. To find the best algorithm among above, comparison is made in terms of compression: Size, Ratio, Time (Speed), and Entropy. The paper is concluded by the decision showing which algorithm performs best over text data.

並列關鍵字

Data Compression Huffman Coding LZW RLE

被引用紀錄


吳紹豪(2017)。透過MQTT調配式架構達到節省成本的支出〔碩士論文,淡江大學〕。華藝線上圖書館。https://doi.org/10.6846/TKU.2017.00876
Chung, P. Y. (2015). 雲端系統重構工具 [master's thesis, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2015.00339
黃韋學(2014)。結合適地性服務之雲端行動學習系統開發與實作〔碩士論文,國立臺北科技大學〕。華藝線上圖書館。https://doi.org/10.6841/NTUT.2014.00437
曾莉婷(2012)。雲端運算科技之使用者接受度研究〔碩士論文,國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU.2012.01019
李依金函(2013)。電子病歷交換與其對醫院績效之前因探討: 雲端運算觀點〔碩士論文,國立中正大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0033-2110201613564771

延伸閱讀