论文标题
压缩键排序和快速索引重建
Compressed Key Sort and Fast Index Reconstruction
论文作者
论文摘要
在本文中，我们通过证明索引密钥的区别是足够的信息来确定正确的信息，以确定索引键的排序顺序，从而提出了一个基于区别位概念的索引密钥压缩方案。尽管实际的压缩比可能取决于数据集的特性（在我们的实验中观察到平均2.76至一个压缩比），但指数键压缩方案在重建大规模指数期间会导致绩效的显着改善。我们的索引密钥压缩可以有效地用于现代主机数据库系统的数据库复制和索引恢复。
In this paper we propose an index key compression scheme based on the notion of distinction bits by proving that the distinction bits of index keys are sufficient information to determine the sorted order of the index keys correctly. While the actual compression ratio may vary depending on the characteristics of datasets (an average of 2.76 to one compression ratio was observed in our experiments), the index key compression scheme leads to significant performance improvements during the reconstruction of large-scale indexes. Our index key compression can be effectively used in database replication and index recovery of modern main-memory database systems.
