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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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