|
Title |
Cache-Friendly Compressed Boolean Matrices |
|
Authors |
Antonio Fariña, Adrián Gómez-Brandón, Asunción Gómez-Colomer, Gonzalo Navarro |
|
Publication date |
2025 |
|
Abstract |
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%. |
|
Pages |
95-108 |
|
Conference name |
International Symposium on String Processing and Information
Retrieval |
|
Publisher |
Springer-Verlag (Berlin/Heidelberg, Germany) |
|
Reference URL |
|
