Inverted index compression and query processing with optimized document ordering

By Hao Yan, Shuai Ding, Torsten Suel. The Web Conference, 2009

298 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A General SIMD-Based Approach to Accelerating Compression Algorithms (2015, background): “Yan et al. [Yan et al. 2009] proposed two new variants called NewPFD and OptPFD.”
Spatial Keyword Query Processing: An Experimental Evaluation (2013, methodology): “The SFC-QUAD index is essential an inverted ﬁle in which the docIDs and frequencies of objects are compressed using the OPT-PFD algorithm [23].”
Decoding billions of integers per second through vectorization (2012, methodology): “compulsory bit width exceptions compressed exceptions PFOR [23] yes per page per page no PFOR2008 [26] yes per page per page 8, 16, 32 bits NewPFD/OptPFD [10] no per block per block Simple-16 FastPFOR (§ 5) no per block per page binary packing SIMD-FastPFOR (§ 5) no per block per page vectorized bin”