Compressing Integers for Fast File Access 论文
1999The Computer Journal引用 216
Algorithms and Data CompressionAdvanced Data Storage TechnologiesCellular Automata and Applications
摘要
this paper we show experimentally that, for large or small collections, storing integers in a compressed format reduces the time required for either sequential stream access or random access. We compare di#erent approaches to compressing integers, including the Elias gamma and delta codes, Golomb coding, and a variable-byte integer scheme. As a conclusion, we recommend that, for fast access to integers, files be stored compressed