TY - GEN
T1 - GPU-accelerated decoding of integer lists
AU - Mallia, Antonio
AU - Siedlaczek, Michał
AU - Suel, Torsten
AU - Zahran, Mohamed
N1 - Funding Information:
Acknowledgements. This research was supported by NSF Grant IIS-1718680 and a grant from Amazon.
Funding Information:
This research was supported by NSF Grant IIS-1718680 and a grant from Amazon.
Publisher Copyright:
© 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.
PY - 2019/11/3
Y1 - 2019/11/3
N2 - An inverted index is the basic data structure used in most current large-scale information retrieval systems. It can be modeled as a collection of sorted sequences of integers. Many compression techniques for inverted indexes have been studied in the past, with some of them reaching tremendous decompression speeds through the use of SIMD instructions available on modern CPUs. While there has been some work on query processing algorithms for Graphics Processing Units (GPUs), little of it has focused on how to efficiently access compressed index structures, and we see some potential for significant improvements in decompression speed. In this paper, we describe and implement two encoding schemes for index decompression on GPU architectures. Their format and decoding algorithm is adapted from existing CPU-based compression methods to exploit the execution model and memory hierarchy offered by GPUs. We show that our solutions, GPU-BP and GPU-VByte, achieve significant speedups over their already carefully optimized CPU counterparts.
AB - An inverted index is the basic data structure used in most current large-scale information retrieval systems. It can be modeled as a collection of sorted sequences of integers. Many compression techniques for inverted indexes have been studied in the past, with some of them reaching tremendous decompression speeds through the use of SIMD instructions available on modern CPUs. While there has been some work on query processing algorithms for Graphics Processing Units (GPUs), little of it has focused on how to efficiently access compressed index structures, and we see some potential for significant improvements in decompression speed. In this paper, we describe and implement two encoding schemes for index decompression on GPU architectures. Their format and decoding algorithm is adapted from existing CPU-based compression methods to exploit the execution model and memory hierarchy offered by GPUs. We show that our solutions, GPU-BP and GPU-VByte, achieve significant speedups over their already carefully optimized CPU counterparts.
KW - Compression
KW - Graphics Processing Units (GPUs)
KW - Inverted Indexes
UR - http://www.scopus.com/inward/record.url?scp=85075432144&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85075432144&partnerID=8YFLogxK
U2 - 10.1145/3357384.3358067
DO - 10.1145/3357384.3358067
M3 - Conference contribution
AN - SCOPUS:85075432144
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 2193
EP - 2196
BT - CIKM 2019 - Proceedings of the 28th ACM International Conference on Information and Knowledge Management
PB - Association for Computing Machinery
T2 - 28th ACM International Conference on Information and Knowledge Management, CIKM 2019
Y2 - 3 November 2019 through 7 November 2019
ER -