Work

Compressed Key Sort and Fast Index Reconstruction

Year: 2020

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2009.11543

Authors: Kwon, Yongsik, Ryu, Cheol, Cha, Sang Kyun, Lee, Arthur H., Park, Kunsoo, Moon, Bongki

Institutions: Seoul National University, Systems, Applications & Products in Data Processing (United Kingdom), SUNY Korea

Language: English

Topic: Advanced Database Systems and Queries

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Ministry of Science and ICT, South Korea, Institute for Information and Communications Technology Promotion

Awards: G1028142539, G1606997556, G5818228703

OpenAlex ID: W3088995759

Cites: 44

Cited by: 1

Related to: 20