Binary codes for locally homogeneous sequences

Authors:
Alistair Moffat;Vo Ngoc Anh
Affiliations:
Department of Computer Science and Software Engineering, The University of Melbourne, Melbourne, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Melbourne, Australia
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 1

Managing gigabytes (2nd ed.): compressing and indexing documents and images

Managing gigabytes (2nd ed.): compressing and indexing documents and images
Modern Information Retrieval

Modern Information Retrieval
Binary Interpolative Coding for Effective Index Compression

Information Retrieval
Burrows--Wheeler compression with variable length integer codes

Software—Practice & Experience
Inverted Index Compression Using Word-Aligned Binary Codes

Information Retrieval

Compressing term positions in web indexes

Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval

Quantified Score

Hi-index	0.89

Visualization

Abstract

Static codes for the non-negative integers have a range of applications, including in the storage of inverted indexes, and in dictionary-based compression systems. We present two simple codes based on binary representations that are suited for message sequences in which the values are locally homogeneous, but not globally consistent. Experimental results based on typical sequences are given to show the efficacy of the new methods.