Compression Dictionary Search Using Order Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression methods face inefficiencies in processing character strings, particularly when searching for compression codes, as they often require redundant comparisons and increased processing due to the length of character strings and combinations, leading to higher computational demands.
Innovation Solution
A method that utilizes a compression program to read character strings from a file, examine order information for concatenated character strings in a compression dictionary, and selectively search the dictionary based on this information to allocate compression codes efficiently, reducing unnecessary searches and improving compression ratios.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If compression codes are allocated to combinations of character strings to improve compression ratio, then compression ratio is improved, but searching processing time increases due to longer comparison target character strings
Solution Approach 1:
The patent segments the searching process into two distinct phases: first searching the compression code allocation table for individual character strings, and then searching the concatenated character string table only when needed. This segmentation reduces the overall searching time by avoiding redundant searches in the concatenated table, while still achieving improved compression ratios through concatenated code allocation.
Solution Approach 2:
The patent performs preliminary searching in the compression code allocation table before attempting to search the concatenated character string table. By checking whether individual character strings have compression codes first, the system avoids unnecessary searches in the concatenated table, thereby reducing processing time while maintaining the ability to achieve high compression ratios when applicable.
2Loss of substance
If searching is performed for both individual character strings and concatenated character strings, then compression ratio is improved, but redundant searching increases processing amount
Solution Approach 1:
The patent inverts the conventional searching approach by first checking the compression code allocation table for individual character strings, and only proceeding to search the concatenated character string table when the individual search fails or when concatenation is beneficial. This inverted approach eliminates redundant searching while preserving compression improvements.
Solution Approach 2:
The patent extracts and separates the searching operations into distinct steps: first extracting and searching individual character strings in the compression code allocation table, then extracting and searching concatenated character strings only when necessary. This separation eliminates redundant processing while maintaining compression effectiveness.
3Loss of substance
If compression codes are allocated to concatenated character strings, then compression ratio is improved, but searching complexity increases due to multiple comparisons
Solution Approach 1:
The patent segments the searching operation into two distinct tables with different purposes: the compression code allocation table for individual character strings and the concatenated character string table for combined strings. This segmentation simplifies the searching process by allowing the system to choose the appropriate table based on the search target, reducing overall searching complexity while maintaining compression improvements.
Solution Approach 2:
The patent performs preliminary checking in the compression code allocation table before searching the concatenated character string table. This preliminary action simplifies the overall searching complexity by filtering out cases that don't require concatenated string searching, thereby reducing the number of complex comparisons needed while preserving compression ratio improvements.
Data Source
AI summary
A non-transitory computer-readable recording medium has stored therein a compression program that causes a computer to execute a process. The process includes: reading a plurality of character strings from a compression target file; examining order information whether there are any concatenated character strings that contain a certain character string in the plurality of character strings with an order of the certain character string, in a compression dictionary, the compression dictionary correlating a plurality of concatenated character strings with a plurality of compression codes respectively, each of the plurality of concatenated character strings include a plurality of character strings, the order information indicating whether there is a specific character string in the compression dictionary with an order of the specific character string; and searching the compression dictionary utilizing the plurality of character strings when the order information indicates that one or more concatenated character strings include the certain character string.