{"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}
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.