Please use this identifier to cite or link to this item:
Title: ItCompress: An iterative semantic compression algorithm
Authors: Jagadish, H.V.
Ng, R.T.
Ooi, B.C. 
Tung, A.K.H. 
Issue Date: 2004
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.
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
DOI: 10.1109/ICDE.2004.1320034
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 18, 2019


checked on Mar 18, 2019

Page view(s)

checked on Mar 24, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.