Exploiting clustering in inverted file compression
暂无分享,去创建一个
[1] Shmuel Tomi Klein,et al. Model based concordance compression , 1992, Data Compression Conference, 1992..
[2] David C. van Voorhis,et al. Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[3] S. Golomb. Run-length encodings. , 1966 .
[4] Aviezri S. Fraenkel,et al. Novel Compression of Sparse Bit-Strings — Preliminary Report , 1985 .
[5] Alistair Moffat,et al. Parameterised compression for sparse bitmaps , 1992, SIGIR '92.
[6] Solomon W. Golomb,et al. Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.
[7] Alistair Moffat,et al. Adding compression to a full‐text retrieval system , 1995, Softw. Pract. Exp..
[8] Shmuel Tomi Klein,et al. Compression of concordances in full-text retrieval systems , 1988, SIGIR '88.
[9] Shmuel T. Klein,et al. Modeling word occurrences for the compression of concordances , 1995, Proceedings DCC '95 Data Compression Conference.
[10] P.G. Howard,et al. Fast and efficient lossless image compression , 1993, [Proceedings] DCC `93: Data Compression Conference.
[11] T. Raita,et al. Markov models for clusters in concordance compression , 1994, Proceedings of IEEE Data Compression Conference (DCC'94).
[12] Jukka Teuhola,et al. A Compression Method for Clustered Bit-Vectors , 1978, Inf. Process. Lett..
[13] Ian H. Witten,et al. Data compression in full-text retrieval systems , 1993 .