An Efficient Direct Access Algorithm for Integer Compression

In our previous work [1], we introduced a technique for reordering prefix codes, enabling direct access functionality without the need for additional storage. In this paper, we extend our previous work [1] into integer compression. Concurrently, we minimized the bit count required for random access reads. We first restructured the codeword of the variable-length quantity (VLQ) code, allowing the determination of the codeword's length through its prefix. In addition, an efficient direct access algorithm for the reorganized VLQ code is given. The simulation outcomes indicate that in scenarios where the encoded stream prohibits the allocation of extra space, the proposed method results in a reduction of bits per access read by more than three orders of magnitude and is 4× less than both the conventional VLQ scheme and the current solution.