Query Collection Optimization via Common Term Frequency Prioritization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Executing a large number of individual queries against electronic documents is resource-intensive and inefficient, often resulting in duplicative searches due to the sequential execution of queries in existing systems.
Innovation Solution
Optimizing query collections by identifying and prioritizing common terms based on frequency, creating optimized query paths that search for the most frequent terms first and preventing searches for terms not found in the documents, thereby reducing processing time and resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If individual queries are executed sequentially against electronic documents, then each query can be processed completely, but the processing time and computing resources increase significantly
Solution Approach 1:
The patent performs preliminary analysis of the query collection to identify common terms and their frequencies before executing queries against documents. This preliminary action allows the system to prioritize queries containing frequent common terms, ensuring that the most likely matching queries are executed first while still maintaining complete query processing
Solution Approach 2:
The patent segments the query collection into groups based on common term frequency. Queries are divided into priority levels where queries containing high-frequency common terms are segmented into higher priority groups. This segmentation allows parallel processing of different query groups, reducing overall processing time while ensuring each query is fully executed
2Loss of information
If all individual queries in a query collection are executed, then comprehensive search results are obtained, but duplicative searches are performed consuming additional resources
Solution Approach 1:
The patent merges queries that share common terms into combined search operations. When multiple queries contain the same common term, the system performs a single search for that term and reuses results across all queries containing it. This merging eliminates duplicative searches while preserving complete search coverage by ensuring all unique terms are still searched
Solution Approach 2:
The patent creates and uses a frequency-based priority model that copies and reuses search results for common terms across multiple queries. Once a common term is searched and its results obtained, those results are copied and applied to all queries containing that term, avoiding redundant search operations while maintaining query collection completeness
3Ease of manufacture
If queries are executed in sequence without optimization, then implementation is simple, but processing efficiency is low
Solution Approach 1:
The patent changes the parameter of query execution order from sequential to priority-based ordering. Queries are assigned priority parameters based on the frequency of their common terms in the query collection. This parameter change maintains implementation simplicity by using basic frequency counting and sorting, while dramatically improving processing efficiency by executing high-priority queries first
Data Source
AI summary
Computer program products and methods for query collection optimization and executing a query collection against one or more electronic documents are disclosed. According to one embodiment, a method of executing a query collection having a plurality of full term queries against an electronic document includes receiving the query collection, determining common terms, and searching the electronic document for the common terms in accordance with a frequency that the common terms appear in the query collection. The method further includes, for each common term found in the electronic document, searching the electronic document for full term queries that include the common term that was found in the electronic document. The method further includes, for each common term not found in the electronic document, preventing a search of the electronic document for the full term queries that include the common term that was not found in the electronic document.