On the compression of search trees

作者：

Highlights：

• Space-efficient representation for non-decreasing sequences of integers.

• Efficient support for random access and searches.

• Proved performance in main and secondary memory.

• Results competitive with the state of the art.

• Applications to several domains: posting lists, sparse bitmaps, geographic data, etc.

摘要

•Space-efficient representation for non-decreasing sequences of integers.•Efficient support for random access and searches.•Proved performance in main and secondary memory.•Results competitive with the state of the art.•Applications to several domains: posting lists, sparse bitmaps, geographic data, etc.

论文关键词：Data structure,Compression,Integers,Random access,Search

论文评审过程：Received 7 July 2012, Revised 26 August 2013, Accepted 21 November 2013, Available online 8 December 2013.

论文官网地址：https://doi.org/10.1016/j.ipm.2013.11.002