| Bookstein A., Klein S.T., Flexible compression for bitmap sets, Proc. Data Compression Conference, Snowbird, Utah (1991) 402--410. |
....code, and with a batched variant, where the code was selected according to blog p w c. Again there is a small, but definite, improvement in the compression performance. 8 Comparison with Other Methods There has been a great deal of previous work on bitmap compression, and many methods proposed [1, 2, 3, 4, 5, 8, 12, 17, 19, 21]. It is interesting to compare the compression possible with the parameterised models with those previous methods. Compression Manuals GNUbib Comact Huffman (global) 49.8 32.3 25.9 Global model 0.5 0.7 0.1 Total 50.3 33.0 26.0 Huffman (batched) 44.1 30.2 24.6 dlog Ne models 1.6 0.9 0.2 ....
A. Bookstein and S.T. Klein. Flexible compression for bitmap sets. In J.A. Storer and J.H. Reif, editors, Proc. IEEE Data Compression Conference, pages 402--410, Snowbird, Utah, April 1991.
....to frequently occurring words are more likely to have been turned on than those in rows corresponding to rarer words. Similarly, in columns associated with longer documents, the probability of a bit being on is greater than for a shorter document. In this paper, which extends the work in [4] and [5] we are exploring the possibility of exploiting the structure between as well as within bitmaps to compress the whole bit table, using simple models of bit occurrence. The strategy of separating model construction and compression method continues the now well established practice of ....
Bookstein A., Klein S.T., Flexible compression for bitmap sets, Proc. Data Compression Conference, Snowbird, Utah (1991) 402--410.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC