Past access to files of integers is crucial for the efficient resolution of queries to databases. integers are the basis of indexes used to resolve queries, for example, in large internet search systems, and numeric d...
详细信息
Past access to files of integers is crucial for the efficient resolution of queries to databases. integers are the basis of indexes used to resolve queries, for example, in large internet search systems, and numeric data forms a large part of most databases. Disk access costs can be reduced by compression, if the cost of retrieving a compressed representation from disk and the CPU cost of decoding such a representation is less than that of retrieving uncompressed data. In 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 different approaches to compressing integers, including the Elias gamma and delta codes, Golomb coding, and a variable-byteintegerscheme. As a conclusion, we recommend that, for fast access to integers, files be stored compressed.
暂无评论