Please use this identifier to cite or link to this item:
|Title:||ItCompress: An iterative semantic compression algorithm|
|Citation:||Jagadish, H.V., Ng, R.T., Ooi, B.C., Tung, A.K.H. (2004). ItCompress: An iterative semantic compression algorithm. Proceedings - International Conference on Data Engineering 20 : 646-657. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2004.1320034|
|Abstract:||Real datasets are often large enough to necessitate data compression. Traditional 'syntactic' data compression methods treat the table as a large byte string and operate at the byte level. The tradeoff in such cases is usually between the ease of retrieval (the ease with which one can retrieve a single tuple or attribute value without decompressing a much larger unit) and the effectiveness of the compression. In this regard, the use of semantic compression has generated considerable interest and motivated certain recent works. In this paper, we propose a semantic compression algorithm called ItCompress ITerative Compression, which achieves good compression while permitting access even at attribute level without requiring the decompression of a larger unit. ItCompress iteratively improves the compression ratio of the compressed output during each scan of the table. The amount of compression can be tuned based on the number of iterations. Moreover, the initial iterations provide significant compression, thereby making it a cost-effective compression technique. Extensive experiments were conducted and the results indicate the superiority of ItCompress with respect to previously known tehniques, such as 'SPARTAN' and 'fascicles'.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 11, 2018
WEB OF SCIENCETM
checked on Jul 25, 2018
checked on Jul 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.