Dynamic Resource Limit Adjustment for Data Search Query Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data search methods face challenges in dynamically adjusting resource limits during query execution, leading to potential resource exhaustion and processing delays, as they often rely on fixed or estimated cache sizes that may not accurately reflect actual resource usage.
Innovation Solution
A computer-implemented data search method and device that predicts resource usage based on past data processing relationships, dynamically changing the upper limit value for query processing to optimize resource allocation and prevent excessive resource consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a memory with a value that is larger than the maximum value by a predetermined ratio is secured as a cache, then resource exhaustion is prevented, but search efficiency and search speed are decreased
Solution Approach 1:
The patent applies dynamics by transitioning from a fixed cache size to a dynamically adjustable cache size. The cache size is modified based on the actual data amount to be searched, allowing the system to adapt resource allocation to real-time needs. This resolves the contradiction by enabling the cache to be large enough when needed (preventing resource exhaustion) and small enough when not needed (maintaining search efficiency).
Solution Approach 2:
The patent changes the parameter of cache size from a static value to a dynamic value that adjusts based on the data amount. By modifying this parameter according to actual search requirements, the system can prevent resource exhaustion when data amounts are large while maintaining search efficiency when data amounts are small, thus resolving the technical contradiction.
2Device complexity
If a fixed upper limit value of resource amount is set for query processing, then resource allocation is simplified, but unexpected resource exhaustion and processing delays occur
Solution Approach 1:
The patent applies dynamics by making the resource upper limit value adjustable rather than fixed. The limit is dynamically modified based on the data amount to be searched, allowing the system to maintain simple resource allocation mechanisms while adapting to varying search requirements, thus preventing unexpected resource exhaustion without significantly increasing complexity.
Solution Approach 2:
The patent enables the system to automatically adjust resource limits based on the data amount without requiring complex external intervention. The query management product itself performs the adjustment based on observed data amounts, making the system self-regulating and preventing resource exhaustion while maintaining relatively simple overall complexity.
3Quantity of substance
If the cache size is set based on the average value of search amount, then memory usage is optimized, but cached data becomes insufficient when search amount exceeds average, decreasing hit ratio
Solution Approach 1:
The patent applies dynamics by adjusting the cache size based on the actual data amount to be searched rather than using a fixed average value. This allows the cache to be appropriately sized for each search operation, maintaining memory optimization while ensuring sufficient cached data is available even when search amounts exceed the average, thus preserving cache hit ratio.
Data Source
Figure 1~2
Figure 3
Figure 4~6
AI summary
A data search device includes a prediction unit that predicts a resource amount to be used in query processing scheduled to be executed, using a relationship between query processing executed in a past and a resource amount used in the query processing, and a change unit that changes an upper limit value of a resource amount usable in query processing to the predicted resource amount to be used in the query processing scheduled to be executed for which execution has been permitted.