Huffman Tree Compression with Character Presence Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional techniques for compressing and generating character component tables for document files are inefficient, as they require separate processes and result in increased processing time due to the large number of document files and character codes involved.
Innovation Solution
A non-transitory computer-readable medium stores an information processing program that uses a Huffman tree to compress character codes by converting them into compression symbols, with a compression symbol map group indicating the presence or absence of character codes in files, and updates bit strings to optimize the compression process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If separate processes are used for compression and character component table generation, then each process can be executed independently, but the processing time is increased
Solution Approach 1:
The patent merges the compression process and character component table generation process into a single integrated process. The Huffman tree construction simultaneously performs compression symbol assignment and tracks character code presence/absence in files, eliminating the need for separate execution of these processes and reducing total processing time.
Solution Approach 2:
The patent enables continuous useful action by having the compression process and table generation process occur concurrently within the same execution flow. As character codes are processed for compression, the same data stream is used to update the compression symbol map, ensuring no redundant processing steps and maintaining continuous productive action throughout the system.
2Quantity of substance
If a huge number of document files are compressed to reduce read speed, then storage efficiency is improved, but the compression process becomes more complex
Solution Approach 1:
The Huffman tree structure serves multiple functions simultaneously: it acts as the compression algorithm, the data structure for encoding character codes, and the mechanism for generating the character component table. This multi-functionality reduces the overall system complexity despite handling a huge number of document files, as a single structure accomplishes what would otherwise require multiple separate components.
Data Source
AI summary
A recording medium stores an information processing program that causes a computer to execute storing a compression symbol map group having a bit string indicating for each character code, presence or absence of the character code in a file group, and a Huffman tree whose leaf corresponding to the character code has a pointer to a compression symbol map of the character code, the Huffman tree converting the character code into a compression symbol of the character code; compressing sequentially and according to the Huffman tree, a character code to be compressed and described in a file of the file group; detecting access to the leaf at the compressing; identifying by a pointer in the accessed leaf, a compression symbol map of the character code to be compressed; and updating a bit that indicates presence or absence of the character code to be compressed, in the identified compression symbol map.