Y. Okada, M. Tokuyo, S. Yoshida, N. Okayasu, H. Shimoi
{"title":"Effective management of compressed data with packed file systems","authors":"Y. Okada, M. Tokuyo, S. Yoshida, N. Okayasu, H. Shimoi","doi":"10.1109/DCC.1997.582127","DOIUrl":null,"url":null,"abstract":"Summary form only given. Lossless data compression is commonly used on personal computers to increase their storage capacity. For example, we can get twice the normal capacity by using lossless data compression algorithms. However, it is necessary to locate compressed data of variable sizes in a fixed-size block with as little fragmentation as possible. This can be accomplished by compressed data management (CDM). The amount of storage capacity provided by data compression depends on the ability of CDM. If CDM does not eliminate fragmentation sufficiently, one cannot attain the storage capacity corresponding to the compression ratio. We present an efficient CDM using a new packed file system (PFS). We confirmed that the PFS achieves and maintains 95% of high space efficiency by using only 1/1000 of the table size needed for the entire storage capacity without employing garbage collection.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Summary form only given. Lossless data compression is commonly used on personal computers to increase their storage capacity. For example, we can get twice the normal capacity by using lossless data compression algorithms. However, it is necessary to locate compressed data of variable sizes in a fixed-size block with as little fragmentation as possible. This can be accomplished by compressed data management (CDM). The amount of storage capacity provided by data compression depends on the ability of CDM. If CDM does not eliminate fragmentation sufficiently, one cannot attain the storage capacity corresponding to the compression ratio. We present an efficient CDM using a new packed file system (PFS). We confirmed that the PFS achieves and maintains 95% of high space efficiency by using only 1/1000 of the table size needed for the entire storage capacity without employing garbage collection.