Factorization-based lossless compression of inverted indices
conference on information and knowledge management, Volume abs/1108.1956, 2011, Pages 327-332.
compression approachapproach maps termnon-zero elementsparse term-document matrixmatrix factorization problemMore(16+)
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non-zero elements indicate the strength of term-document associations. In this work, we present an approach for lossless compression of inverted indices. Our approa...More
PPT (Upload PPT)