用于字段级数据文件压缩的固定长度半顺序保留代码

Motomichi Toyama, S. Ura
{"title":"用于字段级数据文件压缩的固定长度半顺序保留代码","authors":"Motomichi Toyama, S. Ura","doi":"10.1109/ICDE.1984.7271278","DOIUrl":null,"url":null,"abstract":"An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fixed length semiorder preserving code for field level data file compression\",\"authors\":\"Motomichi Toyama, S. Ura\",\"doi\":\"10.1109/ICDE.1984.7271278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.\",\"PeriodicalId\":365511,\"journal\":{\"name\":\"1984 IEEE First International Conference on Data Engineering\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1984 IEEE First International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1984.7271278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1984 IEEE First International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1984.7271278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种新的数据压缩方法——FLSOPC编码方案。所生成的定长码在本文定义的半序保存意义上保持了原始数据表示的顺序。采用二进制分割分配算法的FLSOPC要求代码大小与数据基数的对数成线性关系。在没有先验数据知识的情况下,它大约是FLMB(固定长度最小比特)编码所需的2.8倍。如果已有一半的数据作为初始负载可用,则该因子可以降至2.1;如果已知的数据更多,则该因子接近1。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fixed length semiorder preserving code for field level data file compression
An encoding scheme (FLSOPC) is presented as a new data compression method. The generated fixed-length codes are preserving the order on the original data representations in the sense of semiorder preservation as defined in this paper. The FLSOPC employing binary sectioning assignment algorithm requires the code size that is linear to logarithm of the data cardinality. It is about 2.8 times that required by FLMB (fixed-length minimum bit) encoding when no knowledge about data is given a priori. This factor can be reduced to 2.1 if a half of data has been available as the initial load and approaches 1 when even more data is known.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信