Word search method of compressing search tree based on bit mapping

A technology of bit mapping and key tree, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of low query efficiency, waste of space, complex construction and maintenance, etc., achieve fast positioning, save storage space, Effect of search speed improvement

Inactive Publication Date: 2008-11-05
SUN YAT SEN UNIV +1
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The tree-structured word retrieval does not need to predict the length of the word to be queried during a query process, and can be matched word by word along the tree chain; the disadvantage is that its construction and maintenance are more complicated, and word In comparison, the query efficiency is low
Moreover, each node generally has left and right subtree nodes, which wastes a certain amount of 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
  • Word search method of compressing search tree based on bit mapping
  • Word search method of compressing search tree based on bit mapping

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] Below in conjunction with accompanying drawing, the present invention is further elaborated:

[0033] figure 1 The figure in the middle is the incompletely compressed key tree representation of a word. The left figure is the key tree representation before compression, and the right figure is the compressed key tree representation. The box structure represents a node whose key word is multi-character.

[0034] figure 2 It is a schematic diagram of a compressed key tree based on a mapping relationship, in which the data structure of a node includes a keyword, a pointer of the eldest child node, a record pointer of word interpretation and a bitmap code. The bit mapping relationship of words is reflected in the bit code.

[0035] A kind of word retrieval method based on the compressed key tree of bitmap among the present invention, when word is retrieved to key tree node TreeNode[i] (i starts from 0), if the next character of the word to be searched is e( Or a~z), by d...

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 word retrieval method based on a bit mappings compressing bond tree, which relates to the word retrieval technique in an electronic dictionary. The method defines non-complete compressing rules, can compress the nodes of the bond tree whose keywords are mono character, to forms nodes whose keywords are multiple character. The nodes whose keywords are mono character and the nodes whose keywords are multiple character will not be taken as brother nodes, a bit mappings method is used to represent whether the corresponding son node exists in the bond tree structure, and does not need to compare, and directly locates the position of the son node through calculation, thereby the retrieval velocity can be largely improved, though a certain memory space is sacrificed.

Description

technical field [0001] The invention belongs to the technical field of electronic learning products, in particular to a word retrieval method based on a bit-mapped compressed key tree. Background technique [0002] Practical electronic dictionaries generally have a large number of words, and it is usually necessary to use indexes to improve the dictionary structure, and use corresponding retrieval algorithms to improve search speed. [0003] Dictionary data is data closely related to characters, and the process of word retrieval can be regarded as a path from root to leaf of a tree, so electronic dictionaries generally use a tree structure for word retrieval. [0004] Tree-structure retrieval methods are relatively common at present, such as B-tree retrieval, B-tree retrieval, B+ tree retrieval, hB* tree retrieval, key tree retrieval (also known as TRIE index tree), PATRICIA tree retrieval, etc. The tree structure retrieval method generally includes two basic operations for...

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 SUN YAT SEN UNIV
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