ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Generative models for bitmap sets with compression applications: (extended abstract)
Full text PdfPdf (840 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Chicago, Illinois, United States
Pages: 63 - 71  
Year of Publication: 1991
ISBN:0-89791-448-1
Authors
Abraham Bookstein  Center for Information and Language Studies, University of Chicago, Chicago, IL
Shmuel T. Klein  Dept of Mathematics & CS and Dept. of Economics & BA, Bar Ilan University, Israel
Sponsors
AICA : Assoc Italianai de Calcolo Automatico
BCS-IRSG : BCS/Information Retrieval Specialist Group
German Comp Soc : GI - Gesellshaft for Informatik
SIGIR: ACM Special Interest Group on Information Retrieval
INRIA : Institut Natl de Recherche en Info et en Automatique
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 22,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/122860.122867
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Apostolico , A. S. Fraenkel, Robust transmission of unbounded strings using Fibonacci representations, IEEE Transactions on Information Theory, v.33 n.2, p.238-245, March 1987  [doi>10.1109/TIT.1987.1057284]
2
Timothy Bell , Ian H. Witten , John G. Cleary, Modeling for text compression, ACM Computing Surveys (CSUR), v.21 n.4, p.557-591, Dec. 1989  [doi>10.1145/76894.76896]
3
A. Bookstein , S. T. Klein, Construction of optimal graphs for bit-vector compression, Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval, p.327-342, September 05-07, 1990, Brussels, Belgium  [doi>10.1145/96749.98236]
 
4
Bookstein A., Klein S.T., Flexible compression for bitmap sets, Proc. Data Compression Conference, Snowbird, Utah (1991) 402-410.
5
A. S. Fraenkel , S. T. Klein , Y. Choueka , E. Segal, Improved hierarchical bit-vector compression in document retrieval systems, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, p.88-96, September 1986, Palazzo dei Congressi, Pisa, Italy  [doi>10.1145/253168.253190]
 
6
Elias P., Universal codeword sets and representations of integers, IEEE Trans. on Inf. Th. IT-21 (1975) 194-203.
 
7
Fraenkel A.S., Klein S.T., Novel compression of sparse bit-strings, in Combinatorial Algorithms on Words, NATO ASI Series Vol F12, Springer Verlag, Berlin (1985) 169-183.
 
8
Richard W. Hamming, Coding and information theory (2nd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1986
 
9
Jakobsson M., Huffman coding in bitvector compression, Inf. Processing Letters 7 (1978) 304-307.
 
10
Longo G., Galasso G., An application of informational divergence to Huffman codes, IEEE Trans. on Inf. Th. IT-28 (1982) 36-43.
 
11
Edward M. Reingold , Jurg Nievergelt , Narsingh Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall College Div, 1977
 
12
Schuegraf E.j., Compression of large inverted files with hyperbolic term distribution, Inf. Proc. and Management 12 (1976)377-384.
 
13
Teuhola J., A compression method for clustered bit-vectors, Inf. Processing Letters 7 (1978) 308-311.
 
14
Wedekind H., Hg_rder T., Datenbanksysteme II, B.-I. Wissenschaftsverlag, Mannheim (1976).
15
Ian H. Witten , Radford M. Neal , John G. Cleary, Arithmetic coding for data compression, Communications of the ACM, v.30 n.6, p.520-540, June 1987  [doi>10.1145/214762.214771]

CITED BY  3
Alistair Moffat , Justin Zobel, Parameterised compression for sparse bitmaps, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, p.274-285, June 21-24, 1992, Copenhagen, Denmark
Justin Zobel , Alistair Moffat, Inverted files for text search engines, ACM Computing Surveys (CSUR), v.38 n.2, p.6-es, 2006
Justin Zobel , Alistair Moffat , Ron Sacks-Davis, Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files, Proceedings of the 19th International Conference on Very Large Data Bases, p.290-301, August 24-27, 1993

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing
          Subjects: Indexing methods

Additional Classification:
  E. Data
  E.4 CODING AND INFORMATION THEORY
      Subjects: Data compaction and compression

  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Retrieval models

  I. Computing Methodologies
  I.7 DOCUMENT AND TEXT PROCESSING


General Terms:
Documentation, Experimentation, Theory

Collaborative Colleagues:
Abraham Bookstein: colleagues
Shmuel T. Klein: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player