Improved hierarchical bit-vector compression in document retrieval systems

Y. Choueka; A. S. Fraenkel; S. T. Klein; E. Segal

doi:10.1145/253168.253190

Improved hierarchical bit-vector compression in document retrieval systems

Y. Choueka, A. S. Fraenkel, S. T. Klein, E. Segal

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

34 Scopus citations

Abstract

The "concordance" of an information retrieval system can often be stored in form of bit-maps, which are usually very sparse and should be compressed. Hierarchical bit-vector compression consists of partitioning a vector into equi-sized blocks, constructing a new bit- vector V_i+1which points to the non-zero blocks in V_i, dropping the zero-blocks of V_iand repeating the process for V_i+1- We refine the method by pruning some of the tree branches if they ultimately point to very few documents; these document numbers are then added to an appended list which is compressed by the prefix-omission technique. The new method was thoroughly tested on the bit-maps of the Responsa Retrieval Project, and gave a relative improvement of about 40% over the conventional hierarchical compression method.

Original language	English
Title of host publication	Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986
Editors	Fausto Rabitti
Publisher	Association for Computing Machinery, Inc
Pages	88-96
Number of pages	9
ISBN (Electronic)	0897911873, 9780897911870
DOIs	https://doi.org/10.1145/253168.253190
State	Published - 1 Sep 1986
Event	9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986 - Pisa, Italy Duration: 8 Sep 1986 → 10 Sep 1986

Publication series

Name	Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986

Conference

Conference	9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986
Country/Territory	Italy
City	Pisa
Period	8/09/86 → 10/09/86

Bibliographical note

Publisher Copyright:
© Organization of the 1986-ACM Conference on Research and Development in Information Retrievel.

Access to Document

10.1145/253168.253190

Cite this

Choueka, Y., Fraenkel, A. S., Klein, S. T., & Segal, E. (1986). Improved hierarchical bit-vector compression in document retrieval systems. In F. Rabitti (Ed.), Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986 (pp. 88-96). Article 253190 (Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986). Association for Computing Machinery, Inc. https://doi.org/10.1145/253168.253190

Choueka, Y. ; Fraenkel, A. S. ; Klein, S. T. et al. / 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, SIGIR 1986. editor / Fausto Rabitti. Association for Computing Machinery, Inc, 1986. pp. 88-96 (Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986).

@inproceedings{d952cd82e2f04d1ba3739afc631b614c,

title = "Improved hierarchical bit-vector compression in document retrieval systems",

abstract = "The {"}concordance{"} of an information retrieval system can often be stored in form of bit-maps, which are usually very sparse and should be compressed. Hierarchical bit-vector compression consists of partitioning a vector into equi-sized blocks, constructing a new bit- vector Vi+1which points to the non-zero blocks in Vi, dropping the zero-blocks of Viand repeating the process for Vi+1- We refine the method by pruning some of the tree branches if they ultimately point to very few documents; these document numbers are then added to an appended list which is compressed by the prefix-omission technique. The new method was thoroughly tested on the bit-maps of the Responsa Retrieval Project, and gave a relative improvement of about 40\% over the conventional hierarchical compression method.",

author = "Y. Choueka and Fraenkel, \{A. S.\} and Klein, \{S. T.\} and E. Segal",

note = "Publisher Copyright: {\textcopyright} Organization of the 1986-ACM Conference on Research and Development in Information Retrievel.; 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986 ; Conference date: 08-09-1986 Through 10-09-1986",

year = "1986",

month = sep,

day = "1",

doi = "10.1145/253168.253190",

language = "אנגלית",

series = "Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986",

publisher = "Association for Computing Machinery, Inc",

pages = "88--96",

editor = "Fausto Rabitti",

booktitle = "Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986",

}

Choueka, Y, Fraenkel, AS, Klein, ST & Segal, E 1986, Improved hierarchical bit-vector compression in document retrieval systems. in F Rabitti (ed.), Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986., 253190, Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986, Association for Computing Machinery, Inc, pp. 88-96, 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986, Pisa, Italy, 8/09/86. https://doi.org/10.1145/253168.253190

Improved hierarchical bit-vector compression in document retrieval systems. / Choueka, Y.; Fraenkel, A. S.; Klein, S. T. et al.
Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986. ed. / Fausto Rabitti. Association for Computing Machinery, Inc, 1986. p. 88-96 253190 (Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improved hierarchical bit-vector compression in document retrieval systems

AU - Choueka, Y.

AU - Fraenkel, A. S.

AU - Klein, S. T.

AU - Segal, E.

PY - 1986/9/1

Y1 - 1986/9/1

N2 - The "concordance" of an information retrieval system can often be stored in form of bit-maps, which are usually very sparse and should be compressed. Hierarchical bit-vector compression consists of partitioning a vector into equi-sized blocks, constructing a new bit- vector Vi+1which points to the non-zero blocks in Vi, dropping the zero-blocks of Viand repeating the process for Vi+1- We refine the method by pruning some of the tree branches if they ultimately point to very few documents; these document numbers are then added to an appended list which is compressed by the prefix-omission technique. The new method was thoroughly tested on the bit-maps of the Responsa Retrieval Project, and gave a relative improvement of about 40% over the conventional hierarchical compression method.

AB - The "concordance" of an information retrieval system can often be stored in form of bit-maps, which are usually very sparse and should be compressed. Hierarchical bit-vector compression consists of partitioning a vector into equi-sized blocks, constructing a new bit- vector Vi+1which points to the non-zero blocks in Vi, dropping the zero-blocks of Viand repeating the process for Vi+1- We refine the method by pruning some of the tree branches if they ultimately point to very few documents; these document numbers are then added to an appended list which is compressed by the prefix-omission technique. The new method was thoroughly tested on the bit-maps of the Responsa Retrieval Project, and gave a relative improvement of about 40% over the conventional hierarchical compression method.

UR - https://www.scopus.com/pages/publications/84989588478

U2 - 10.1145/253168.253190

DO - 10.1145/253168.253190

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84989588478

T3 - Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986

SP - 88

EP - 96

BT - Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986

A2 - Rabitti, Fausto

PB - Association for Computing Machinery, Inc

T2 - 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986

Y2 - 8 September 1986 through 10 September 1986

ER -

Choueka Y, Fraenkel AS, Klein ST, Segal E. Improved hierarchical bit-vector compression in document retrieval systems. In Rabitti F, editor, Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986. Association for Computing Machinery, Inc. 1986. p. 88-96. 253190. (Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1986). doi: 10.1145/253168.253190

Improved hierarchical bit-vector compression in document retrieval systems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this