Query Graph Search Disambiguation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Search systems face inefficiencies when handling ambiguous search queries, as they often require making assumptions or explicitly searching multiple interpretations, which can lead to incorrect results and increased processing resources.
Innovation Solution
A server device generates a query graph with nodes and paths representing different search possibilities, allowing the search process to traverse the graph and data structure based on interim results, thereby disambiguating queries and reducing the search space.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the search system explicitly searches multiple interpretations of ambiguous queries, then the reliability of search results is improved, but the processing time and resource consumption increase
Solution Approach 1:
The patent applies dynamics by making the search process adaptive and flexible. The system dynamically adjusts the search strategy based on interim results obtained during traversal. When ambiguity is detected, the system can switch between different paths in the query graph depending on what matches are found, rather than following a fixed predetermined search order. This allows the system to maintain high reliability by exploring multiple interpretations while reducing processing time by abandoning unpromising paths early.
Solution Approach 2:
The patent implements feedback by using interim results obtained during the search process to guide subsequent search decisions. The system continuously monitors matches found during traversal and uses this information to determine whether to continue down the current path or switch to alternative paths in the query graph. This feedback mechanism ensures that the system maintains reliability by exploring necessary interpretations while improving efficiency by focusing resources on promising search paths.
2Productivity
If the search system makes assumptions about query interpretations to reduce processing time, then the productivity is improved, but the reliability of search results deteriorates
Solution Approach 1:
The patent applies partial action by performing a limited form of interpretation exploration rather than exhaustively searching all possible interpretations. The system traverses the query graph and data structure simultaneously, obtaining interim results that allow it to disambiguate queries without needing to explore every possible path. This partial exploration approach maintains productivity by avoiding exhaustive search while preserving reliability by sufficiently exploring the necessary interpretations to achieve accurate results.
3Reliability
If the search system traverses multiple paths in the query graph to resolve ambiguities, then the reliability is improved, but the search space increases
Solution Approach 1:
The patent applies segmentation by dividing the search process into distinct phases corresponding to different paths in the query graph. Each path represents a specific interpretation of the ambiguous query, and the system traverses these segmented paths in a controlled manner. The query graph itself is segmented into nodes representing different interpretation possibilities, allowing the system to manage complexity by treating each interpretation as a separate, manageable unit rather than overwhelming the system with all possibilities simultaneously.
Solution Approach 2:
The patent applies dynamics by making the path selection in the query graph adaptive rather than static. The system dynamically determines which paths to traverse based on interim results obtained during the search process. When ambiguity is resolved through matches found in the data structure, the system can dynamically abandon unnecessary paths, thereby reducing the effective search space while maintaining reliability by exploring sufficient paths to achieve accurate disambiguation.
4Loss of time
If the search system abandons paths when no matches are found, then the processing time is reduced, but the risk of missing potential results increases
Solution Approach 1:
The patent implements feedback by using interim results to guide path abandonment decisions in the query graph. The system continuously monitors matches found during traversal and uses this information to determine whether to continue or abandon paths. This feedback ensures that paths are only abandoned when sufficient evidence indicates they will not lead to valid results, thereby reducing processing time while maintaining result completeness. The feedback mechanism allows the system to make informed abandonment decisions rather than arbitrary ones.
Data Source
AI summary
A device can receive a search query. The search query can relate to a geographic location. The device can process the search query to parse the search query into a plurality of strings. The plurality of strings can include text. The device can determine that one or more strings, of the plurality of strings, satisfy a condition. The device can generate, using the plurality of strings, a query graph that includes a plurality of paths relating to the condition. The query graph can further include a plurality of nodes leading to and/or included in the plurality of paths, and a plurality of transitions between the plurality of nodes. The device can perform one or more actions relating to the query graph to obtain, from a data structure, one or more search results that correspond to the search query.