Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and system for conducting compression and query on sparse matrix

A sparse matrix and matrix technology, which is applied in the fields of compressing and querying sparse matrices and systems, can solve the problems of redundant information storage and large space occupation of sparse matrices, and achieves storage space saving, storage number reduction, and query speed. Effect

Active Publication Date: 2015-07-29
INST OF INFORMATION ENG CAS
View PDF2 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in view of the fact that the sparse matrix occupies a large space and the information storage is redundant, the traditional triple method can no longer meet the current needs.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for conducting compression and query on sparse matrix
  • Method and system for conducting compression and query on sparse matrix
  • Method and system for conducting compression and query on sparse matrix

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach

[0068] In the present invention, the specific implementation of the system for constructing sparse matrix compression is as follows:

[0069] 1) Perform a preprocessing operation on the sparse matrix to obtain a suitable sparse matrix;

[0070] For the sparse matrix to be processed, first set the block size k; if the sparse matrix is ​​not a square matrix, it is first converted to a square matrix according to the optimization method; if the value stored in the sparse matrix is ​​not 0 or 1, it is first converted to 0 and 1 sparse matrix, and then temporarily store the original matrix to facilitate the determination of V(leaves) and rank(leaves) values ​​later. Finally, a suitable sparse matrix A and its scale row height are n. Load a sparse matrix into memory.

[0071] 2) Use the algorithm of the construction process to construct a node tree through the sparse matrix A and the block size k and obtain T (tree) and L (leaves);

[0072] According to the preprocessing operation...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a method and system for conducting compression and query on a sparse matrix. According to the method, a k2-tree method is improved on the aspects of rank operation change and common matrix and non-zero matrix processing. Firstly, a sparse matrix to be processed is preprocessed to obtain a sparse matrix A of a square matrix with a unit value 0 or1; then, a k2-tree algorithm is adopted to obtain arrays T (tree) and L (leaves), the Rank array interval fixing digits are stored according to information in the T (tree) to obtain Rank (tree), V (leaves) and rank (leaves) values are obtained according to the L (leaves) and an original corresponding sparse matrix, and stored values in the sparse matrix A can be queried after coordinates of query units are input. The sparse matrix can be effectively compressed, query speed is higher, and more storage space is saved.

Description

technical field [0001] Sparse matrices are widely used in the fields of information security, content filtering, and graph computing. The present invention aims to solve the problems of large space occupation and sparse information in sparse matrices, and compresses sparse matrices to support direct query and access to sparse matrices. . Background technique [0002] Sparse matrix can be applied in many aspects such as information security and content filtering. In terms of content filtering and information security, the string matching problem has a wide range of applications in intrusion detection, virus detection, text retrieval, search engines, and biological computing. There are many classification methods of string matching algorithm. According to the data structure used by the algorithm, it can be divided into matching algorithm based on table lookup and matching algorithm based on automaton: the pattern string is stored in the form of hash table, and the matching pr...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 张春燕张宇刘燕兵谭建龙郭莉
Owner INST OF INFORMATION ENG CAS
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com