Decoding billions of integers per second through vectorization. (28th May 2013)

• Record Type: Journal Article
• Authors: Lemire, D.; Boytsov, L.
• Is Part Of: Software, practice & experience. Volume 45:Number 1(2015)
• Page Start: 1
• Page End: 29
• Publication Date: 2013-05-28
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2203
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2203-abs-0001"> <title>SUMMARY</title> <p id="spe2203-para-0001">In many important applications—such as search engines and relational database systems—data are stored in the form of arrays of integers. Encoding and, most importantly, decoding of these arrays consumes considerable CPU time. Therefore, substantial effort has been made to reduce costs associated with compression and decompression. In particular, researchers have exploited the superscalar nature of modern processors and single‐instruction, multiple‐data (SIMD) instructions. Nevertheless, we introduce a novel vectorized scheme called SIMD‐BP128^⋆ that improves over previously proposed vectorized approaches. It is nearly twice as fast as the previously fastest schemes on desktop processors (varint‐G8IU and PFOR). At the same time, SIMD‐BP128^⋆ saves up to 2 bits/int. For even better compression, we propose another new vectorized scheme (SIMD‐FastPFOR) that has a compression ratio within 10% of a state‐of‐the‐art scheme (Simple‐8b) while being two times faster during decoding. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>