bit: Classes and Methods for Fast Memory-Efficient Boolean Selections

Michael Chirico, Jens Oehlschlägel · 2008

Provided are classes for boolean and skewed boolean vectors, fast boolean methods, fast unique and non-unique integer sorting, fast set operations on sorted and unsorted sets of integers, and foundations for ff (range index, compression, chunked processing).

Read the paper · More papers on PaperTik