Cache-Friendly Compressed Boolean Matrices

Antonio Fariña, Adrián Gómez-Brandón, Asunción Gómez-Colomer, and Gonzalo Navarro

We introduce a new compressed representation of sparse Boolean matrices that enjoys reference locality properties. We build on an existing representation based on LOUDS-deployed cardinal trees, and design one based instead on DFUDS. While this brings various complications, we show that the resulting matrix representation is considerably faster to carry out sums and multiplications, with speedups of up to 60%.