{"title":"矢量量化无损文本数据压缩","authors":"W. K. Ng, C. Ravishankar","doi":"10.1109/DCC.1995.515584","DOIUrl":null,"url":null,"abstract":"Summary form only given. Vector quantisation (VQ) may be adapted for lossless data compression if the data exhibit vector structures, such as in textural relational databases. Lossless VQ is discussed and it is demonstrated that a relation of tuples may be encoded and allocated to physical disk blocks such that standard database operations such as access, insertion, deletion, and update may be fully supported.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Vector quantization for lossless textual data compression\",\"authors\":\"W. K. Ng, C. Ravishankar\",\"doi\":\"10.1109/DCC.1995.515584\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. Vector quantisation (VQ) may be adapted for lossless data compression if the data exhibit vector structures, such as in textural relational databases. Lossless VQ is discussed and it is demonstrated that a relation of tuples may be encoded and allocated to physical disk blocks such that standard database operations such as access, insertion, deletion, and update may be fully supported.\",\"PeriodicalId\":107017,\"journal\":{\"name\":\"Proceedings DCC '95 Data Compression Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '95 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1995.515584\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '95 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1995.515584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Vector quantization for lossless textual data compression
Summary form only given. Vector quantisation (VQ) may be adapted for lossless data compression if the data exhibit vector structures, such as in textural relational databases. Lossless VQ is discussed and it is demonstrated that a relation of tuples may be encoded and allocated to physical disk blocks such that standard database operations such as access, insertion, deletion, and update may be fully supported.