Map Segment Search Management Across Multiple Storage Engines
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing storage devices face inefficiencies in searching for map segments across multiple search engines, leading to increased overhead.
Innovation Solution
Incorporating a search engine manager to determine and manage target map segments from a plurality of search engines, minimizing the need for direct searches and optimizing the search process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple search engines are used to store map segments, then the search capability and data availability are improved, but the overhead and complexity of managing and searching across multiple engines increases
Solution Approach 1:
The patent introduces a search engine manager as an intermediary component that coordinates between the controller and multiple search engines. This manager handles the complexity of managing multiple search engines by providing a unified interface, determining which search engines to query based on map segment types, and aggregating results. This resolves the contradiction by maintaining high search capability through multiple engines while reducing management overhead through centralized coordination.
Solution Approach 2:
The patent divides the search process into segments by categorizing map segments into different types (e.g., L2P map segments, P2L map segments) and directing queries to specific search engines based on the segment type. This segmentation allows each search engine to specialize in certain types of map segments, improving search efficiency while reducing the overall complexity by avoiding full-scene searches across all engines.
2Reliability
If multiple search engines are used to store map segments, then the reliability and redundancy of data access are improved, but the time and resources required to search across multiple engines increases
Solution Approach 1:
The patent implements preliminary action by having the search engine manager determine in advance which search engines contain the required map segments before executing the search. The manager analyzes the map segment type and pre-identifies the relevant search engines, so that when a search is needed, only the appropriate engines are queried. This reduces search time while maintaining reliability through selective redundancy.
Solution Approach 2:
The patent applies partial action by querying only the necessary subset of search engines rather than all available engines. The search engine manager determines the minimal set of engines that contain the required map segments based on the segment type and distribution, performing a partial search that is sufficient to find the data without the overhead of searching all engines. This reduces search time while maintaining data availability.
3Loss of information
If direct searching is performed across multiple search engines, then complete map segment coverage is achieved, but the overhead and processing burden increases
Solution Approach 1:
The search engine manager serves as an intermediary that eliminates the need for direct searching across multiple engines by the controller. The manager receives search requests, determines the appropriate search engines and map segments, and returns results to the controller. This intermediary approach achieves complete map segment coverage while significantly reducing the search overhead and processing burden on the controller.
Solution Approach 2:
The patent implements a virtual copy of the search functionality through the search engine manager, which maintains knowledge of the distribution and types of map segments across all search engines. Instead of directly searching multiple engines, the controller copies the search request to the manager, which then executes the search using its knowledge base and returns results. This copying approach maintains complete coverage while reducing overhead.
Data Source
AI summary
A storage device may include a plurality of search engines each capable of storing a plurality of map segments. Each of the map segments may indicate a respective mapping relationship between a logical address area and a physical address area. A search engine manager of the storage device may determine, from among map segments stored in the plurality of search engines, N number of target map segments respectively corresponding to N number of target logical address areas. A controller of the storage device may read data corresponding to the N number of target logical address areas on the basis of the N number of target map segments.