2N-Branch Nodeless Huffman Tree Search Precision
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing search methods using Huffman trees face low precision when searching for character strings that are not basic words, as they fail to efficiently handle abbreviations and partial character inputs, leading to incorrect division of search results.
Innovation Solution
A 2N-branch nodeless Huffman tree is implemented, allowing for efficient compression and decompression of character strings by generating a comparison and substitution table that connects compression codes of preceding and succeeding words, enabling accurate matching and substitution of character strings.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional Huffman tree search is used for non-basic words, then compression efficiency is maintained, but search precision deteriorates due to incorrect division of search results
Solution Approach 1:
The patent segments the search process into two distinct phases: first searching the character string directly in the database, and second searching preceding and succeeding words when the direct search fails. This segmentation allows the system to handle basic words and non-basic words differently, improving search precision without requiring a complete redesign of the Huffman tree structure.
Solution Approach 2:
The patent performs preliminary action by pre-processing and storing compression codes of preceding and succeeding words in the database during the indexing phase. This allows the search system to quickly retrieve and combine these pre-computed codes without performing complex real-time decompression and re-compression operations, thus improving search precision while maintaining structural efficiency.
2Measurement precision
If direct character string search is performed, then search speed is improved, but search precision deteriorates when the character string is an abbreviation or non-basic word
Solution Approach 1:
The patent applies partial action by first attempting a direct search of the character string without full decomposition. Only when this direct search fails does the system proceed to the more time-consuming method of searching preceding and succeeding words. This partial approach minimizes unnecessary processing time while ensuring high search precision for both basic words and abbreviations.
Solution Approach 2:
The patent introduces an intermediary mechanism - the database storing compression codes of preceding and succeeding words - that mediates between the direct search method and the decompression-recompression method. This intermediary allows the system to quickly determine whether a direct search succeeded and to efficiently retrieve alternative search results, balancing speed and precision.
3Measurement precision
If each character is searched separately for non-basic words, then search completeness is improved, but search precision deteriorates due to acquisition of unrelated results
Solution Approach 1:
The patent merges the compression codes of preceding and succeeding words into a single connected compression code. By combining these codes and searching for them together in the compression file, the system maintains search completeness for non-basic words while avoiding the acquisition of unrelated results that would occur with separate character searches, thus improving both precision and efficiency.
Solution Approach 2:
The patent creates a universal search mechanism that handles both basic words and non-basic words (including abbreviations) through the same integrated process. The system universally applies the strategy of searching preceding and succeeding words when direct search fails, eliminating the need for different search algorithms and improving overall search efficiency while maintaining high precision across all word types.
Data Source
AI summary
A compression file formed by compressing an object file is compared in a compressed state with a compression code string that matches with a compression character string of a character string to be searched for. The compression code string acquiring no match as the result of the comparison is decompressed as it is. On the other hand, the compression code string acquiring match is substituted with a substituted character string in a comparison and substitution table generated in advance.