Search Request Control Apparatus Reducing Redundant Searches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data search technologies, such as high-traffic and index technologies, do not always improve data search efficiency when the volume of overlapped data searched by simultaneous search requests is small, leading to redundant searches and inefficiencies.
Innovation Solution
A search request control apparatus that splits search requests into subsets based on the degree of overlap, calculates the average response time for each subset, and processes them in a manner that minimizes redundant searches, thereby improving data search efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If search requests are processed collectively using high-traffic technology, then search time is reduced, but redundant searches occur when data overlap is small
Solution Approach 1:
The patent segments search requests into different groups based on their data overlap characteristics. Search requests with high data overlap are grouped together for collective processing, while those with low overlap are processed individually or in smaller groups. This segmentation allows the system to optimize processing efficiency for each group type, avoiding redundant searches when overlap is minimal while still achieving time reduction when overlap is significant.
2Productivity
If index technology is used to directly search data, then data search efficiency is improved, but redundant searches occur when multiple requests access the same data
Solution Approach 1:
The patent implements a feedback mechanism where the system monitors data access patterns across multiple search requests. When it detects that multiple requests are accessing the same or overlapping data, it provides feedback to consolidate these requests and eliminate redundant operations. This feedback loop enables the system to dynamically adjust processing strategies based on actual data overlap, reducing wasted search operations while maintaining efficient data retrieval.
3Ease of operation
If search requests are processed in the transmitted order, then processing simplicity is maintained, but average response time increases due to inefficient ordering
Solution Approach 1:
The patent introduces dynamic reordering of search request processing based on predicted search speeds and data overlap characteristics. Instead of maintaining a fixed transmission order, the system dynamically adjusts the processing sequence by identifying requests with higher predicted search speeds and positioning them earlier in the processing queue. This dynamic approach balances processing simplicity with optimized response times, reordering requests only when it significantly improves overall efficiency.
Data Source
AI summary
A search request control apparatus includes a processor to execute a process. The process includes splitting a search request set, which contains a plurality of search requests acquired in a predetermined period, into subsets in accordance with a degree of overlap of data searched by each of the search requests, calculating an average response of the search requests contained in the search request set in accordance with a processing order of the subsets that are obtained through the splitting, and processing collectively in accordance with the processing order, search requests contained in a plurality of subsets having a minimum average response calculated.