一种改进的序列数据压缩Lempel-Ziv算法

S. K. Jena
{"title":"一种改进的序列数据压缩Lempel-Ziv算法","authors":"S. K. Jena","doi":"10.1142/S0129053399000132","DOIUrl":null,"url":null,"abstract":"The importance of data compression has been increasing of late due to the increasing demand put on the networks by applications consuming high amount of network bandwidth. Thus compressing data to at least a particular level becomes mandatory for applications to avoid congestion in the network. Recently there has been an interest in increasing the capacity of storage systems, which employ lossless data compression. In this paper, we have proposed two improved algorithms for data compression. These algorithms are tested and compared with best known existing algorithms of data compression. It has been observed that compression rate of our proposed algorithms reaches up to 99% for huge files like swap files.","PeriodicalId":270006,"journal":{"name":"Int. J. High Speed Comput.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Lempel-Ziv Algorithm for Sequential Data Compression\",\"authors\":\"S. K. Jena\",\"doi\":\"10.1142/S0129053399000132\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The importance of data compression has been increasing of late due to the increasing demand put on the networks by applications consuming high amount of network bandwidth. Thus compressing data to at least a particular level becomes mandatory for applications to avoid congestion in the network. Recently there has been an interest in increasing the capacity of storage systems, which employ lossless data compression. In this paper, we have proposed two improved algorithms for data compression. These algorithms are tested and compared with best known existing algorithms of data compression. It has been observed that compression rate of our proposed algorithms reaches up to 99% for huge files like swap files.\",\"PeriodicalId\":270006,\"journal\":{\"name\":\"Int. J. High Speed Comput.\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. High Speed Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0129053399000132\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. High Speed Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129053399000132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于应用程序消耗大量网络带宽,对网络的需求不断增加,数据压缩的重要性日益增加。因此,为了避免网络中的拥塞,应用程序必须将数据压缩到至少一个特定级别。最近,人们对增加采用无损数据压缩的存储系统的容量很感兴趣。在本文中,我们提出了两种改进的数据压缩算法。对这些算法进行了测试,并与已知的现有数据压缩算法进行了比较。研究发现,对于交换文件这样的大文件,我们提出的算法的压缩率高达99%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Lempel-Ziv Algorithm for Sequential Data Compression
The importance of data compression has been increasing of late due to the increasing demand put on the networks by applications consuming high amount of network bandwidth. Thus compressing data to at least a particular level becomes mandatory for applications to avoid congestion in the network. Recently there has been an interest in increasing the capacity of storage systems, which employ lossless data compression. In this paper, we have proposed two improved algorithms for data compression. These algorithms are tested and compared with best known existing algorithms of data compression. It has been observed that compression rate of our proposed algorithms reaches up to 99% for huge files like swap files.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信