Verbatim Integer List 带来的空间开销，人们发明了Integer List Compression机制。
PEF (Partitioned Elias Fano)
PFOR/PFOR Delta
* Data Structures for Inverted Indexes ([https://github.com/ot/ds2i ds2i])
* [http://github.com/ot/partitioned_elias_fano Partitioned Elias-Fano Index]
**研究论文：
# Daniel Lemire, Daniel, and Christoph Rupp. "Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions." Information Systems (, 2017).
# Inoue, Hiroshi, Moriyoshi Ohara, and Kenjiro Taura, Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions, VLDB 2014.
# Kane, Andrew, and Frank Wm Tompa, Skewed Partial Bitvectors for List Intersection, SIGIR 2014.
# Lakshminarasimhan, Sriram, et al. "Scalable in situ scientific data encoding for analytical query processing." HPDC 2013.
# Schlegel, Benjamin, Thomas Willhalm, and Wolfgang Lehner. Fast Sorted-Set Intersection using SIMD Instructions, ADMS 2011.
# Zukowski, Marcin, Sandor Heman, Niels Nes, and Peter Boncz. "Super-scalar RAM-CPU cache compression." ICDE 2006.
== 位图（Bitmap） ==