Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2309.04355 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908427772493824 |
|---|---|
| author | Ruiter, Skyler Wolfgang, Seth Tunnell, Marc Triche Jr., Timothy Carrier, Erin DeBruine, Zachary |
| author_facet | Ruiter, Skyler Wolfgang, Seth Tunnell, Marc Triche Jr., Timothy Carrier, Erin DeBruine, Zachary |
| contents | Compressed Sparse Column (CSC) and Coordinate (COO) are popular compression formats for sparse matrices. However, both CSC and COO are general purpose and cannot take advantage of any of the properties of the data other than sparsity, such as data redundancy. Highly redundant sparse data is common in many machine learning applications, such as genomics, and is often too large for in-core computation using conventional sparse storage formats. In this paper, we present two extensions to CSC: (1) Value-Compressed Sparse Column (VCSC) and (2) Index- and Value-Compressed Sparse Column (IVCSC). VCSC takes advantage of high redundancy within a column to further compress data up to 3-fold over COO and 2.25-fold over CSC, without significant negative impact to performance characteristics. IVCSC extends VCSC by compressing index arrays through delta encoding and byte-packing, achieving a 10-fold decrease in memory usage over COO and 7.5-fold decrease over CSC. Our benchmarks on simulated and real data show that VCSC and IVCSC can be read in compressed form with little added computational cost. These two novel compression formats offer a broadly useful solution to encoding and reading redundant sparse data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_04355 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Value-Compressed Sparse Column (VCSC): Sparse Matrix Storage for Redundant Data Ruiter, Skyler Wolfgang, Seth Tunnell, Marc Triche Jr., Timothy Carrier, Erin DeBruine, Zachary Data Structures and Algorithms Machine Learning Compressed Sparse Column (CSC) and Coordinate (COO) are popular compression formats for sparse matrices. However, both CSC and COO are general purpose and cannot take advantage of any of the properties of the data other than sparsity, such as data redundancy. Highly redundant sparse data is common in many machine learning applications, such as genomics, and is often too large for in-core computation using conventional sparse storage formats. In this paper, we present two extensions to CSC: (1) Value-Compressed Sparse Column (VCSC) and (2) Index- and Value-Compressed Sparse Column (IVCSC). VCSC takes advantage of high redundancy within a column to further compress data up to 3-fold over COO and 2.25-fold over CSC, without significant negative impact to performance characteristics. IVCSC extends VCSC by compressing index arrays through delta encoding and byte-packing, achieving a 10-fold decrease in memory usage over COO and 7.5-fold decrease over CSC. Our benchmarks on simulated and real data show that VCSC and IVCSC can be read in compressed form with little added computational cost. These two novel compression formats offer a broadly useful solution to encoding and reading redundant sparse data. |
| title | Value-Compressed Sparse Column (VCSC): Sparse Matrix Storage for Redundant Data |
| topic | Data Structures and Algorithms Machine Learning |
| url | https://arxiv.org/abs/2309.04355 |