Query Result Set Processing with Network Cost Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search technologies do not effectively account for network costs when processing search queries, leading to increased network resources needed to return search results, which can result in higher costs and reduced responsiveness for users.
Innovation Solution
A computer-implemented method that selects an access path for each database in a set of databases based on minimizing search costs, including network costs, and removes duplicate records from search results to reduce the size of the result set sent to the user, thereby reducing network usage and costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If search results are returned without removing duplicate records, then the completeness of search results is maintained, but network costs increase and responsiveness decreases
Solution Approach 1:
The patent extracts and removes duplicate records from the search result set before returning results to the user. This extraction process identifies redundant records across multiple databases and eliminates them, keeping only unique records in the final result set, thereby reducing network transmission costs while maintaining result quality
Solution Approach 2:
The patent changes the parameter of result set size by removing duplicates. It dynamically adjusts the composition of the result set by identifying and eliminating redundant records based on duplicate detection algorithms, transforming a large result set with duplicates into a smaller, optimized result set without duplicates
2Reliability
If multiple databases are searched to provide comprehensive results, then the completeness of information is improved, but the amount of duplicate records increases
Solution Approach 1:
The patent converts the harmful effect of duplicate records generated by searching multiple databases into a benefit. Instead of viewing duplicates as waste, the system uses them to identify and remove redundant information, transforming the problem of multiple database searches into an opportunity to deliver more refined, de-duplicated results to users
3Adaptability or versatility
If access paths are selected without considering network costs, then search flexibility is maintained, but network resource usage increases
Solution Approach 1:
The patent introduces dynamic selection of access paths based on network cost considerations. The system adaptively chooses different access paths for searching databases depending on the network cost implications, dynamically adjusting the search strategy to balance flexibility with resource efficiency, rather than using a fixed access path approach
Data Source
AI summary
A computer implemented method processes a search query from a requestor. A number of processor units selects an access path from access paths for each database in a set of databases based on reducing a cost for searching the set of databases using a set of access paths selected for the set of databases in response to receiving the search query from a requestor. The number of processor units receives a result set from searching the set of databases using the set of access paths selected for the set of databases. The number of processor units removes a number of duplicate records from records in the result set. The number of processor units sends the result set with the number of duplicate records removed to the requestor.