Database Search Subsets for Reduced Wait Time
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing search systems for large search spaces are inefficient, requiring multiple searches and significant user wait time, as they traditionally search the complete search space or its index, leading to user frustration and increased search duration.
Innovation Solution
The system splits the search space into primary and secondary subsets (indexes) and performs a first search on the primary subset, presenting initial results to the user. If these results are insufficient, the user can initiate a second search on the secondary subset, which may include additional criteria or items not in the primary subset.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If the search engine searches the complete search space or its index, then the search results are comprehensive, but the search time increases significantly
Solution Approach 1:
The search space is divided into multiple subsets (first subset, second subset, third subset) based on different criteria or characteristics. The search engine can selectively search through relevant subsets rather than the entire search space, reducing search time while maintaining result comprehensiveness through systematic coverage of appropriate subsets.
2Measurement precision
If the search engine performs multiple searches for updated queries, then the search results become more accurate, but the total search duration increases
Solution Approach 1:
The search space is pre-divided into multiple subsets before actual search queries are received. This preliminary organization allows the search engine to quickly navigate to relevant subsets without performing time-consuming re-indexing or complete re-searches when users update their queries, thereby maintaining accuracy while reducing total search duration.
3Loss of information
If the search engine indexes the complete search space, then all information is available for searching, but the indexing and search process becomes complex and time-consuming
Solution Approach 1:
The search space is segmented into multiple manageable subsets, each with its own indexing structure. This segmentation reduces the complexity of individual indexing operations and search processes while ensuring that all information remains accessible through systematic navigation between subsets, thereby maintaining information availability without overwhelming complexity.
Data Source
AI summary
Systems and methods for searching subsets of a search space. The system includes a memory with programmable instructions for searching a search space stored thereon, and processor for executing the programmable instructions. A user enters a search query, for example, via the user interface. The system receives a search command including the search query. The system performs a first search of a first subset of the of the search space using the search query. The results from the first search are presented to the user. The system receives a second, supplemental search command from the user, and responsive to the second, supplemental search command, performs a second search, using the same search query, of a second subset of the search space.