Abstract
Bitmaps are data structures occurring oilen in information retrieval. They are useful; they are abo large and expensive to store. For this reason, considerable effort has been devoted to finding techniques for compressing them. These techniques are most effective for sparse bitmaps. We propose a preprocessing stage, in which bitmaps are first clustered and the clusters used to transform their member bitmaps into sparser ones, that can be more effectively compressed. The clustering method efficiently generates a graph structure on the bitmaps. The results ofapplying our algorithm to the Bible is presented: for some sets of bitmaps, our method almost doubled the compression savings.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1990 |
| Editors | Jean-Luc Vidick |
| Publisher | Association for Computing Machinery, Inc |
| Pages | 327-342 |
| Number of pages | 16 |
| ISBN (Electronic) | 0897914082, 9780897914086 |
| DOIs | |
| State | Published - 1 Dec 1989 |
| Externally published | Yes |
| Event | 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1990 - Brussels, Belgium Duration: 5 Sep 1990 → 7 Sep 1990 |
Publication series
| Name | Proceedings of the 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1990 |
|---|
Conference
| Conference | 13th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1990 |
|---|---|
| Country/Territory | Belgium |
| City | Brussels |
| Period | 5/09/90 → 7/09/90 |
Bibliographical note
Publisher Copyright:© ACM 1990.