Minimal Quadtree Format for Compression of Sparse Matrices Storage

Author: Šimeček I.


Keywords
Sparse matrix format; quadtree; zik-zak format; space complexity.


Abstract
Computations with sparse matrices are widespread in scientific projects. Commonly used storage formats (such as COO or CSR) are not suitable for I/O file operations with sparse matrices due to their high space complexities. Memory-efficient formats are still under development. In this paper, we present a new storage format called the Minimal quadtree (MQ) as well as algorithms for converting matrices from common storage formats to the MQ format. We compare the space complexity of common storage formats and of the MQ format and prove that the idea of using the quadtree as the data structure for sparse matrices is viable.


What's new
March 1, 2012 -  version 0.5 of this project is released(MQT format).
August 1, 2012 -  version 0.7 of this project is released(ZikZak format, unpublished).

Known bugs


(Possible) future works

Used in papers
Minimal Quadtree Format for Compression of Sparse Matrices Storage



Parameters and output:
Download:
Conversion to MQT format

Conversion to ZikZak format

BACK