Cache-Friendly Bitmap Compression on Symmetric Multiprocessors

A worksharing model is presented to enhance parallel compression of data-intensive bitmap indices. To increase spatial locality, our approach interleaves multiple independent bitmaps in a combined file. Each file block, which fits entirely in cache, is processed by independent threads. Results show that our model significantly outperforms embarrassingly-parallel designs.