Elias-Fano coding

Previous slides: Bit vectors, Rank & Select Link to heading Bit vector: storing bits Rank: counting 1 bits Select: finding 1 bits Goal: Storing lists of integers Link to heading How do we efficiently store a list of integers \[ 0\leq x_0 \leq x_1 \leq \dots \leq x_{n-1} < U. \] Theorem 1 Lower bound . Using stars and bars , there are \(\binom{U+n-1}{n}\) of choosing \(n\) elements (with…