On the Finite-Length Performance of Universal Coding for K-Ary Memoryless Sources
Recently, the amount of data that is being stored in storage systems has been increasing with a very high rate. Hence, the development of compression for storage systems has gained a lot of interest. In many cases, one complete database may be compressed to less than one tenth of its original size. The redundancy in the data may be leveraged to significantly reduce the cost of data maintenance as well as data transmission. However, most applications require that individual files be retrieved and updated separate from the rest of the database. Therefore, the compressed data for individual files need to be independently retrievable and updateable. On the other hand, the individual files are relatively very small.