Query Processor Segment Loading Sequence Alteration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In computing environments where multiple search queries overload servers, leading to performance issues and potential failures due to excessive disk operations and memory consumption, especially when the indexed store is stored in network storage, causing searches to be executed slowly or fail.
Innovation Solution
A method where a query processor alters the search sequence by allowing multiple search queries to load and evaluate segments of an indexed store together, commencing execution of subsequent queries on the same segment as the initial query, thereby reducing redundant loading and overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the server executes multiple search queries sequentially by loading segments for each query, then each search query can be processed completely, but the server becomes overloaded with excessive disk operations and memory consumption
Solution Approach 1:
The patent merges multiple search queries by loading index segments once and evaluating multiple queries against the same loaded segments simultaneously. This combining approach reduces redundant disk I/O operations and memory allocation, allowing the server to handle multiple queries efficiently without becoming overloaded.
Solution Approach 2:
The patent performs preliminary loading of index segments before executing multiple search queries. By pre-loading the segments into memory once, the system prepares the data structure in advance so that subsequent queries can be evaluated without repeated disk access, improving overall server performance.
2Productivity
If the server limits the number of requests processed during a period to prevent overload, then server performance is maintained, but client requests are denied and performance shortcomings extend to the client
Solution Approach 1:
The patent combines multiple incoming search queries into a single processing operation by loading segments once and evaluating all queries against the loaded segments. This merging eliminates the need to deny requests during high load periods, as the server can efficiently handle multiple queries simultaneously without exceeding resource limits.
3Adaptability or versatility
If the indexed store is stored in network storage, then data can be centralized and accessed by multiple clients, but disk operations become excessive and network congestion occurs during multiple search executions
Solution Approach 1:
The patent merges the execution of multiple search queries by loading index segments from network storage once and evaluating multiple queries against the same loaded segments in memory. This approach reduces the number of disk operations and network I/O operations, preventing network congestion while maintaining centralized data accessibility.
4Reliability
If the server loads segments for each search query individually, then each query can be executed with fresh data, but memory consumption increases and search execution becomes slow
Solution Approach 1:
The patent combines multiple query executions by loading segments once and evaluating multiple queries against the same loaded segments. This merging reduces the total time required for search execution by eliminating redundant loading operations, while the segments remain in memory throughout the evaluation process ensuring data accuracy.
Solution Approach 2:
The patent maintains continuous evaluation of multiple queries against loaded segments without repeated loading interruptions. By keeping segments in memory and continuously evaluating multiple queries against them, the system eliminates the start-stop pattern of repeated loading, reducing total execution time while maintaining data integrity.
Data Source
AI summary
The sequence of one or more searches can be altered to cause multiple searches to load and evaluate segments together. When a first search query is executed, a query processor can commence loading segments of an indexed store to thereby evaluate the first search query against the segments. Then, if a second search query is received while the first search query is executing, the query processor can cause the second search query to commence on the same segment that the first search query is currently being evaluated against. The first and second search queries can then continue execution together until the first search query has been evaluated against all segments. The query processor can then continue executing the second search query against the remaining segments until it reaches the segment on which its execution commenced.