Name
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 with 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 nonvectorized algorithms with respect to decoding speeds. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2735629 | ACM Trans. Inf. Syst. |
Keywords | DocType | Volume |
inverted index,simd | Journal | 33 |
Issue | ISSN | Citations |
3 | ACM Trans. Inf. Syst. 33, 3, Article 15 (March 2015) | 10 |
PageRank | References | Authors |
0.56 | 28 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wayne Xin Zhao | 1 | 1275 | 66.73 |
| Xudong Zhang | 2 | 695 | 63.82 |
| Daniel Lemire | 3 | 821 | 52.14 |
| Dongdong Shan | 4 | 128 | 6.11 |
| Jian-yun Nie | 5 | 3681 | 238.61 |
| Hongfei Yan | 6 | 763 | 35.67 |
| Ji-Rong Wen | 7 | 4431 | 265.98 |