Dynamic Search System On-the-Fly Keyword Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search systems require users to enter a search string and select an 'enter' key before providing search results, resulting in a lag time between input and results, which inefficiencies computing resources and user experience.
Innovation Solution
A dynamic content delivery search system that performs on-the-fly matching of keywords as the user types, queuing up results for immediate presentation without the need to select an 'enter' key, reducing lag and optimizing resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If the search system waits for the user to complete the search string and press enter before performing the search, then the system can process the complete search query, but the user experiences lag time between input and results
Solution Approach 1:
The system performs preliminary search processing as the user types the search string, before the user completes the input and presses enter. This preliminary action prepares search results in advance, eliminating the lag time between query submission and result display.
Solution Approach 2:
The system skips the traditional wait state where the system would idle until the user presses enter. Instead, it rushes through the search processing by continuously updating results based on the current search string state, providing results immediately as the user types.
2Productivity
If the search system performs continuous matching as the user types, then the user receives instant results, but computational resources such as processor cycles and network traffic increase
Solution Approach 1:
The system performs partial search processing by matching only the current state of the search string against the index, rather than re-processing the entire query from scratch. This partial action reduces computational overhead while maintaining continuous result updates.
Solution Approach 2:
The system discards intermediate processing states and recovers only the necessary computation for the current search string state. By managing search processing efficiently, it reduces unnecessary computational resource consumption during continuous matching.
Data Source
AI summary
Example embodiments of the present disclosure include a system comprising a computer-readable storage medium storing at least one program and a computer-implemented method for providing a dynamic content delivery search system. In example embodiments, entry of a first keyword of a search string comprising a plurality of keywords is detected. The first keyword is identified after entry of the first keyword and prior to entry of a second keyword of the search string. A first set of matching results that match the identified first keyword is determined. Entry of the second keyword is detected and the second keyword identified. Using the second keyword, the first set of matching results is refined. The resulting search results are presented to a user.