Data compression storing and retrieving method and system

A technology of data compression and compression algorithm, which is used in electrical digital data processing, special data processing applications, instruments, etc. It can solve problems such as space waste, and achieve the effects of compressing memory consumption, improving query speed, and high query efficiency.

Inactive Publication Date: 2009-08-05
FOCUS TECH
View PDF0 Cites 36 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, Trie (character tree) is generally used for prefix retrieval of dictionaries, and each node stores a character, which causes a great waste of space.
Aiming at the problem of wasting space, we need to design a compression device to solve the problem of wasting space

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
  • Data compression storing and retrieving method and system
  • Data compression storing and retrieving method and system
  • Data compression storing and retrieving method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] The present invention is described in further detail below in conjunction with the accompanying drawings and embodiments.

[0024] The purpose of the present invention is to solve the existing shortcomings of the Trie tree structure, and provide a dictionary management and retrieval method with higher query efficiency and less space occupation than the existing dictionary method. This structure supports the following functions: prefix query, suffix query, feature string to Id mapping query, existence check.

[0025] 1. Improve the Trie tree structure

[0026] The invention improves the Trie tree structure into a character string Trie tree. The basic process is as follows:

[0027] The process of constructing a string Trie tree is roughly divided into the following steps:

[0028] A. Use the improved string Trie tree to index all the data in the dictionary

[0029] A1. Design the nodes in the string Trie tree to store word fragments;

[0030] A2. Design the child no...

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 discloses a device and a method for compression storing data and searching rapidly. At present, processing prefix search to dictionary uses Trie tree (character tree) generally, a character is stored in each node of the character tree which causes great waste of space. The character Trie tree is improved to character series Trie tree that reduces space waste efficiently. The node content in the character series Trie tree is compression processed in a system that has strict memory requirement, and a compression arithmetic is given. The invention can be used in a mobile store device with strict memory space requirement and can embodiment excellent of the method in condition of mass dictionary data. In addition, the device can be used for Suggest function of a search interface of the present internet, existing examination and (KEY, VALUE) type inquire function.

Description

technical field [0001] The invention relates to the fields of communication and computer, and has specific applications in mobile equipment, the Internet, input methods and the like. Background technique [0002] The amount of data in the dictionary is hundreds of thousands or even millions, and its fast retrieval is an urgent problem to be solved. Quickly locating the records where words are located in the dictionary not only has a very wide range of uses on mobile devices, but also belongs to the basic retrieval technology in the field of information retrieval. Dictionaries are frequently queried, and any improvement in their query speed and storage space is significant. [0003] At present, in a large number of application systems, it is often necessary to provide a unique Id of a certain character string, and the character string may be a certain characteristic character string. The usual practice is to create a table in the database, the two columns of the table store...

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 FOCUS TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products