Compression within a Context-Sensitive Commercial Random Access Domain: An Industrial Case Study

An industrial case study of data compression within the library automation domain is described. A context dependent approach, where the individual records require file-independent compression and expansion, is evaluated. The discussed approach favorably compares against popular compression algorithms. Comparisons were made against commercially available implementations of the conventional compression schemes. The described approach is now in use by The Library Corporation.

[1]  R. Nigel Horspool,et al.  Algorithms for Adaptive Huffman Codes , 1984, Inf. Process. Lett..

[2]  Glen G. Langdon,et al.  An Introduction to Arithmetic Coding , 1984, IBM J. Res. Dev..

[3]  Douglas W. Jones,et al.  Application of splay trees to data compression , 1988, CACM.

[4]  Henry Ker-Chang Chang,et al.  A New Locally Adaptive Data Compression Scheme using Multilist Structure , 1993, Comput. J..

[5]  Mark Nelson,et al.  The Data Compression Book , 2009 .

[6]  Ian H. Witten,et al.  Modeling for text compression , 1989, CSUR.

[7]  Glen G. Langdon,et al.  Arithmetic Coding , 1979 .

[8]  Shmuel Tomi Klein,et al.  Compression, information theory, and grammars: a unified approach , 1990, TOIS.

[9]  Shmuel Tomi Klein,et al.  Storing text retrieval systems on CD-ROM: compression and encryption considerations , 1989, TOIS.

[10]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[11]  Jukka Teuhola,et al.  Application of a Finite-State Model to Text Compression , 1993, Comput. J..

[12]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[13]  Donald E. Knuth,et al.  Dynamic Huffman Coding , 1985, J. Algorithms.

[14]  Daniel S. Hirschberg,et al.  Data compression , 1987, CSUR.

[15]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[16]  Alistair Moffat,et al.  Parameterised compression for sparse bitmaps , 1992, SIGIR '92.

[17]  Christopher J. Fox,et al.  A stop list for general text , 1989, SIGF.

[18]  Charles G. Boncelet,et al.  Block arithmetic coding for source compression , 1993, IEEE Trans. Inf. Theory.

[19]  Jeffrey Scott Vitter,et al.  Algorithm 673: Dynamic Huffman coding , 1989, TOMS.

[20]  J. Pike,et al.  Text Compression Using a 4 Bit Coding Scheme , 1981, Comput. J..

[21]  Jeffrey Scott Vitter,et al.  Design and analysis of dynamic Huffman codes , 1987, JACM.

[22]  Zhong Mx.  Advances in Coding and Compression The integration of artificial intelligence, artificial neural networks, and fuzzy logic will yield a new dimension in coding and compression research that will benefit China and the rest of the world during this decade. , 1993 .

[23]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[24]  Benjamin Weiss,et al.  Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.

[25]  IJsbrand Jan Aalbersberg.  Posting compression in dynamic retrieval environments , 1991, SIGIR '91.

[26]  O. Frieder,et al.  Exploiting database technology in the medical arena , 1992, IEEE Engineering in Medicine and Biology Magazine.

[27]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[28]  Shmuel Tomi Klein,et al.  Model based concordance compression , 1992, Data Compression Conference, 1992..

[29]  Matti Jakobsson.  Huffman Coding in Bit-Vector Compression , 1978, Inf. Process. Lett..

[30]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[31]  Robert G. Gallager,et al.  Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[32]  Ian H. Witten,et al.  A comparison of enumerative and adaptive codes , 1984, IEEE Trans. Inf. Theory.