Search Query Validation via Subgraph Connectivity Analysis
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data analysis systems face challenges in validating search queries used for retrieving information from event sequence data, leading to unexpected results due to the complexity of graphical user interfaces, where combinations of user operations can create syntactically correct but practically useless queries, especially with negative predicates making it difficult to notice invalidity.
Innovation Solution
A computer-implemented method that generates a subgraph from the search query, checks for multiple components, and provides an alternative query by adding a new constraint between predicates in different components, derived from existing constraints, to ensure the query aligns with the user's intention without issuing the query.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a graphical user interface is used to create search queries, then ease of operation is improved, but device complexity increases and query validity decreases
Solution Approach 1:
The system performs preliminary validation of the search query by generating a subgraph from positive predicates and checking for connectivity before the query is executed. This preliminary check identifies invalid queries that would otherwise produce unexpected results, allowing the system to prevent execution of flawed queries while maintaining an easy-to-use graphical interface.
2Adaptability or versatility
If negative predicates are added to search queries, then adaptability is improved, but reliability decreases
Solution Approach 1:
The system extracts positive predicates from the complete search query to generate a subgraph for validation. By separating positive predicates from negative predicates, the system can validate the structural connectivity of the query without the complicating factor of negation, thereby maintaining reliability while preserving adaptability.
3Measurement precision
If query validation is performed by actually issuing the search query, then measurement precision is improved, but loss of time increases
Solution Approach 1:
The system performs preliminary validation by constructing a subgraph from positive predicates and checking for connectivity before executing the actual search query. This preliminary structural check identifies invalid queries without requiring full data retrieval, significantly reducing validation time while maintaining sufficient accuracy to prevent execution of flawed queries.
Data Source
AI summary
A computer-implemented method for checking a search query used for retrieving information from a collection of records in an event sequence analysis system is disclosed. The method includes receiving a search query including a plurality of predicates and one or more constraints each associated with plural predicates, in which each predicate is specified to be positive or negative, and the plurality of the predicates forms a logical graph together with the one or more constraints. The method also includes generating from the graph a subgraph including one or more predicates specified to be positive among the plurality of the predicates. The method further includes determining whether the subgraph has plural components or not, and invalidating the search query in response to the subgraph being determined to have plural components.