Large Sparse Matrix Storage Research UB Tree

Sparse matrix has widespread applications, typically we make use of it in areas of network analyze, graph theory, solving differential equation, linear programming, etc. In order to let the computer helping we achieve matrix operations, the first task is to achieve sparse matrix storage.The traditional storage formats for sparse matrix are Compressed Row Storage (CRS) and Compressed Column Storage (CCS). They are both accomplished an efficiently storage for sparse matrix. The CRS store the none-elements row by row and the CCS store none-elements by column.This work reviews the storage of sparse matrix at a view of multi-dimensional data and put forward the sparse matrix storage based on UB-Tree. What does this work included are as followed:①Study the Z-ordering for sparse matrix.②Sparse matrix operations approach base on UB-Tree. The operations include non-zero element search, addition, multiplication, Transpose, etc.③Putting forward a new range query algorithm which better than the old one.④Test the entire achieved algorithm and give the conclusion.