Code String Search Using Code ID Range and Next Code ID Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing character string search methods, such as those using suffix arrays, require significant processing time to create index data for both character strings and code strings, limiting their efficiency in search operations.
Innovation Solution
The implementation of a code ID range table and next code ID table structure, which assigns unique code IDs to codes in code strings, allowing for efficient search operations without the need to create a suffix array, thereby reducing processing burden and time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a suffix array is used for code string search, then search capability for any code string is achieved, but index creation time becomes excessively long
Solution Approach 1:
The invention extracts only the necessary components for search functionality from the suffix array approach. Instead of creating a full suffix array that sorts all suffixes, the patent extracts and stores only the code ID ranges and next code ID mappings, which are sufficient for efficient code string search while dramatically reducing index creation time and complexity.
Solution Approach 2:
The patent creates a simplified copy of the search index structure. Rather than copying the entire suffix array with all its sorting and indexing overhead, the invention creates a streamlined index using code ID ranges and next code ID tables that replicate the search functionality with minimal data storage and processing requirements.
2Adaptability or versatility
If suffix array method is applied to code strings, then comprehensive search is enabled, but processing burden increases significantly
Solution Approach 1:
The invention extracts only the essential search components from the suffix array methodology. The patent identifies and extracts code ID ranges and next code ID mappings as the minimal necessary elements for search functionality, eliminating the complex suffix sorting and array construction processes while maintaining comprehensive search capability.
Solution Approach 2:
The patent segments the code string search process into discrete manageable components: code ID range tables for character-level indexing and next code ID tables for sequential matching. This segmentation breaks down the complex suffix array processing into simpler, more manageable operations that reduce overall processing burden.
3Ease of manufacture
If character string search methods are used for code strings, then existing infrastructure is utilized, but search accuracy for code strings is insufficient
Solution Approach 1:
The patent changes the indexing parameters from character-based to code ID-based. Instead of using character codes directly as indices, the invention assigns unique code IDs to codes in the code string and uses these code IDs for indexing and search operations, thereby maintaining the simplicity of existing infrastructure while achieving precise code string search accuracy.
Data Source
AI summary
A code ID range table holding code ID ranges for each code of a same code type and a next code ID table holding next code IDs are created. Code ID ranges of code types of codes configuring a search code string are read out from the code ID range table for the search target code string, and the stored next code ID corresponding to a code ID included in the code ID range of the code type of the head code in the search code string is read out from the next code ID table while the stored next code IDs corresponding to the next codes are successively read out from the next code ID table, and the next code ID read out from the next code ID table is verified whether it is included in the code ID range read out from the code ID range table.