.png){kind=icon}
Return
Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2017.01.002.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Compression can sometimes improve performance by making more of the data available to the processors faster. We consider the compression of integer keys in a B+-tree index. For this purpose, systems such as IBM DB2 use variable-byte compression over differentially coded keys. We revisit this problem with various compression alternatives such as Google's VarintGB, Binary Packing and Frame-of-Reference. In all cases, we describe algorithms that can operate directly on compressed data. Many of our alternatives exploit the single-instruction-multiple-data (SIMD) instructions supported by modern CPUs. We evaluate our techniques in a database environment provided by Upscaledb, a production-quality key value database. Our best techniques are SIMD accelerated: they simultaneously reduce memory usage while improving single-threaded speeds. In particular, a differentially coded SIMD binary-packing techniques (BP128) can offer a superior query speed (e.g., 40% better than an uncompressed database) while providing the best compression (e.g., by a factor of ten). For analytic workloads, our fast compression techniques offer compelling benefits. Our software is available as open source. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
B plus -tree
Data compression
Vectorization
Key-value stores
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
2.8K
Citations:
1.8K
Organization
Cited Papers
ShareSaveShareSaveShareSaveThe Historical Small Smart City Protocol (HISMACITY): Toward an Intelligent Tool Using Geo Big Data for the Sustainable Management of Minor Historical Assets.png)
DataOAAI
DataIF0
OAAIShareSaveShareSave
View more