A General SIMD-based Approach to Accelerating Compression Algorithms

Abstract

Compression algorithms are important for data oriented tasks, especially in the era of Big Data. Modern processors equipped with powerful SIMD instruction sets, provide us an opportunity for achieving better compression performance. Previous research has shown that SIMD-based optimizations can multiply decoding speeds. Following these pioneering studies, we propose a general approach to accelerate compression algorithms. By instantiating the approach, we have developed several novel integer compression algorithms, called Group-Simple, Group-Scheme, Group-AFOR, and Group-PFD, and implemented their corresponding vectorized versions. We evaluate the proposed algorithms on two public TREC datasets, a Wikipedia dataset and a Twitter dataset. With competitive compression ratios and encoding speeds, our SIMD-based algorithms outperform state-of-the-art non-vectorized algorithms with respect to decoding speeds.

References in corpus (1)

• Decoding billions of integers per second through vectorization

Cited by in corpus (6)

• Sprintz: Time Series Compression for the Internet of Things
• What is the State of Neural Network Pruning?
• Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions
• MorphStore: Analytical Query Engine with a Holistic Compression-Enabled Processing Model
• An Adaptive Column Compression Family for Self-Driving Databases
• Transcoding Billions of Unicode Characters per Second with SIMD Instructions