EliasFanoCompression

EliasFanoCompression: quasi-succinct compression of sorted integers in C#

Elias-Fano encoding is quasi succinct, which means it is almost as good as the best theoretical possible compression scheme for sorted integers.
While it can be used to compress any sorted list of integers, we will use it for compressing posting lists of inverted indexes.
Based on a research paper by Sebastiano Vigna: http://vigna.di.unimi.it/ftp/papers/QuasiSuccinctIndices.pdf

Blog Post

Elias-Fano: quasi-succinct compression of sorted integers in C#

Copyright (C) 2016 Wolf Garbe
Version: 1.0
Author: Wolf Garbe <wolf.garbe@seekstorm.com>
Maintainer: Wolf Garbe <wolf.garbe@seekstorm.com>
URL: https://seekstorm.com/blog/elias-fano-succinct-compression-sorted-integers-csharp/
Description: https://seekstorm.com/blog/elias-fano-succinct-compression-sorted-integers-csharp/

License:
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License, 
version 3.0 (LGPL-3.0) as published by the Free Software Foundation.
http://www.opensource.org/licenses/LGPL-3.0

EliasFanoCompression is contributed by SeekStorm - the high performance Search as a Service & search API