Method for realizing dictionary memory management of Trie tree based on one-dimensional linear space

A linear space and storage management technology, applied in the direction of electrical digital data processing, special data processing applications, instruments, etc., can solve problems such as data movement or storage space backtracking, conflicts, slow dictionary data storage speed, etc., to improve data loading and storage Efficiency, serialization and deserialization are convenient, and the effect of overcoming the backtracking problem of data movement or storage space

Active Publication Date: 2013-10-23
SHENZHEN AUDAQUE DATA TECH
View PDF8 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] However, there is such a problem in this dictionary data storage method based on the Trie tree implemented by double arrays: the conflict caused by inserting a new state will cause a large number of conflicting dictionary data to be moved, which will not only result in slow dictionary data storage speed, but also Can cause backtracking issues with data movement or storage 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
  • Method for realizing dictionary memory management of Trie tree based on one-dimensional linear space
  • Method for realizing dictionary memory management of Trie tree based on one-dimensional linear space
  • Method for realizing dictionary memory management of Trie tree based on one-dimensional linear space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] In order to make the purpose, technical solution and advantages of the present invention more clear, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0038] The embodiment of the present invention provides a dictionary storage management method based on a one-dimensional linear space to realize a Trie tree. The method includes the following steps: obtaining complete dictionary data; generating ordered dictionary data and storing them in a one-dimensional array; creating a Trie The tree implements the storage of dictionary data.

[0039] Such as figure 1 Shown is a flow chart of a one-dimensional linear space implementation of a trie tree dictionary storage management method according to an embodiment of the present invention, including the ...

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 embodiment provides a method for realizing dictionary memory management of Trie tree based on one-dimensional linear space. The method comprises the following steps: acquiring integral dictionary data; generating ordered dictionary data, and storing the data in a one-dimensional array; creating the Trie tree to realize the storing of the dictionary data. The method adopts a one-dimensional array to replace a double array (base [ ] and check [ ]). The method enables the serialization and the serialization of the Trie tree to be more convenient and faster, enables the load storage of the dictionary to be more efficient, meanwhile the method can solve the problem of the data moving or the backtracking of the storage space existing in the method for realizing the dictionary data storing of the Trie tree by the double array.

Description

technical field [0001] The invention relates to a dictionary storage management method, in particular to a dictionary storage management method based on a one-dimensional linear space to realize a Trie tree. Background technique [0002] In the field of information retrieval and natural language processing, especially in the technical application based on the dictionary, the scale of the dictionary is generally very large, with tens of thousands or even hundreds of millions of records, especially the scale of the inverted index in the search engine is the largest . The storage of massive data dictionaries is usually realized by index data structure. Commonly used index structures include linear index tables, inverted lists, hash tables, and search trees. The implementation version of the popular Trie tree on the current network is generally based on a double array. The names of the two arrays are base[] and check[] respectively. The subscript i of each element in the array...

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
CPCG06F16/9027
Inventor 王国印
Owner SHENZHEN AUDAQUE DATA 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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap