String Search Optimization via FM-Index and Parallel Partitioning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current string search methods consume excessive memory and resources, making them inefficient for large-scale text searches and genome sequencing applications.
Innovation Solution
The method involves identifying a first string and a second string, utilizing data structures like FM-index and hash tables, and employing techniques such as partitioning, Bloom filters, and parallel processing to reduce memory usage and enhance search performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If current string search methods are used, then search functionality is provided, but memory consumption is excessive and search speed is slow
Solution Approach 1:
The patent divides the search process into multiple segments by partitioning the search string into substrings and using multiple search processors working in parallel. Each processor handles a portion of the search space, reducing the memory burden on any single processor while maintaining overall search speed.
Solution Approach 2:
The patent introduces an intermediary data structure (such as a suffix array or FM-index) that mediates between the search string and the text being searched. This intermediary structure allows for efficient searching with reduced memory requirements compared to storing the entire search space in memory.
2Reliability
If current string search methods are used, then complete search coverage is achieved, but resource consumption is high
Solution Approach 1:
The patent employs partial action by using probabilistic data structures like Bloom filters that provide approximate search results with high probability rather than exact matches for all cases. This reduces computational resources while maintaining acceptable search accuracy for most practical applications.
Solution Approach 2:
The patent changes parameters of the search algorithm by adjusting the trade-off between memory usage and search completeness. By modifying parameters such as the size of hash tables or the number of hash functions used, the system can adapt resource consumption to match available memory while preserving search reliability within acceptable bounds.
Data Source
AI summary
A system, method, and computer program product are provided for performing a string search. In use, a first string and a second string are identified. Additionally, a string search is performed, utilizing the first string and the second string.