Method for managing and searching dictionary with perfect even numbers group TRIE Tree

A double array and dictionary technology, which is applied in the field of perfect double array TRIE tree dictionary management and retrieval, can solve the problem of trie index tree space waste, and achieve the effect of improving space utilization and reducing sparsity.
CN1786962AActive Publication Date: 2006-06-14灵玖中科软件(北京)有限公司
0 Cites 33 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
灵玖中科软件(北京)有限公司
Publication Date
2006-06-14

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention relates to the fields of natural language processing and information searching, especially a perfect-double array TRIE tree dictionary managing and searching method, converting the Trie tree structure into two linear arrays to express the Trie tree structure and advancing an optimizing policy and an self-adapting coding solution to automatically code characters using a byte as a coding unit, comprising the steps of: (1) expressing a dictionary by the Trie tree structure; (2) converting the Trie tree into two linear arrays; (3) according to the user input, using the two arrays to realize the dictionary searching. And its concrete steps comprise: 1. automatically coding the dictionary by using byte as a unit to generate a sequence code file; 2. expressing the dictionary with the Trie tree and using the sequence code file to convert the Trie tree into two linear arrays; 3. searching the user-submitted words in the two linear arrays.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the fields of natural language processing and information retrieval, in particular to a perfect double array TRIE tree dictionary management and retrieval method. Background technique

[0002] For the storage and search of a large amount of data, the index structure is usually used to realize it at present. Commonly used index structures include linear index tables, inverted lists, hash (Hash) tables, and various search trees.

[0003] The linear index is a static index structure, which is not conducive to updating, and the position of each index item in the index table needs to be changed every time a sequential update is performed. The inverted list is also a static index. It is the same as the linear index table. When searching the data in it, it can only be searched sequentially or in half.

[0004] The hash (Hash) method is to establish a definite corresponding function relationship Hash() between the storage location of...

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