Database Search Engine Intent Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current search engines are limited in optimizing the initial search request for non-textual objects in databases, such as images, due to the complexity of user input requirements and the inability to account for user intent beyond keyword meanings, leading to suboptimal search results.
Innovation Solution
A method that allows users to freely add search elements to a series, which can be repeated multiple times, enabling direct identification and processing of distinct elements by the search engine, including non-textual objects, with relevance and irrelevance indications, and weight assignment to descriptors for improved search results.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If users perform advanced searches using multiple keywords combined with logic operators, then search precision is improved, but device complexity increases and ease of operation deteriorates
Solution Approach 1:
The patent introduces an intermediary system that automatically analyzes user intent from simple search queries and generates optimized search requests with appropriate keywords and logic operators. This mediator translates natural language queries into structured search commands, achieving high search precision without requiring users to manually construct complex search syntax.
Solution Approach 2:
The search system performs self-service by automatically analyzing the user's search intent, selecting relevant keywords, and constructing optimized search queries without user intervention. The system autonomously handles the complexity of combining multiple keywords with logic operators, freeing users from the burden of manual query construction while maintaining high search precision.
2Ease of operation
If search engines use traditional keyword-based methods, then ease of operation is maintained, but measurement precision deteriorates due to synonyms, homonyms, and hierarchy within terms
Solution Approach 1:
The patent transforms the search parameter from simple keywords to a structured representation of user intent that incorporates semantic relationships, synonyms, and hierarchical term structures. By changing the parameter format to include weighted keywords and logical relationships, the system maintains ease of operation while significantly improving search precision through more accurate interpretation of user intent.
Solution Approach 2:
The patent replaces the mechanical keyword-matching system with an intelligent analysis system that uses natural language processing and semantic understanding. This substitution enables the system to comprehend synonyms, homonyms, and term hierarchies, achieving high search precision while keeping the user interface simple and easy to operate.
3Measurement precision
If users manually construct complex search requests with multiple keywords and logic operators, then search precision improves, but loss of time increases
Solution Approach 1:
The patent performs preliminary action by pre-analyzing user intent and pre-generating optimized search queries before the user even submits their request. The system proactively processes the search query, identifies relevant keywords and relationships, and constructs the optimal search request in advance, eliminating the time users would otherwise spend manually constructing complex queries while maintaining high search precision.
Solution Approach 2:
The search system provides self-service by automatically completing the entire query construction process without user involvement. The system independently analyzes intent, selects keywords, determines logical relationships, and formulates the final search request, thereby achieving high precision searches while reducing query construction time to nearly zero.
Data Source
AI summary
The present disclosure relates to a method for searching in a database containing at least one set of objects each linked to at least one descriptor, the search being done by a search engine from at least one request by a user in order to return at least one result object. The request includes at least one search parameter having a series of at least one search element obtained by freely adding elements to the series by the user, the addition step being able to be repeated multiple times until a search instruction is given.