Fast integer compression using SIMD instructions

  • Authors:
  • Benjamin Schlegel;Rainer Gemulla;Wolfgang Lehner

  • Affiliations:
  • Technische Universität Dresden, Dresden, Germany;IBM Almaden Research Center, San Jose, CA;Technische Universität Dresden, Dresden, Germany

  • Venue:
  • Proceedings of the Sixth International Workshop on Data Management on New Hardware
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study algorithms for efficient compression and decompression of a sequence of integers on modern hardware. Our focus is on universal codes in which the codeword length is a monotonically non-decreasing function of the uncompressed integer value; such codes are widely used for compressing "small integers". In contrast to traditional integer compression, our algorithms make use of the SIMD capabilities of modern processors by encoding multiple integer values at once. More specifically, we provide SIMD versions of both null suppression and Elias gamma encoding. Our experiments show that these versions provide a speedup from 1.5x up to 6.7x for decompression, while maintaining a similar compression performance.