Analytic Query Processing for Disjunctive Boolean Expressions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional database management systems face performance issues when processing analytic queries with disjunctive Boolean expressions, as they require extensive processing resources and time due to the need to retrieve and transfer large data records across multiple tables, leading to inefficient data processing.
Innovation Solution
Transforming analytic queries to represent disjunctive Boolean expressions as a combination of nondisjunctive and disjunctive Boolean expressions, allowing for initial filtering on single data tables, thereby reducing the data transferred and processed, and optimizing the evaluation process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all data tables are retrieved and transferred to evaluate disjunctive Boolean expressions, then complete query results are obtained, but processing resources and time consumption increase significantly
Solution Approach 1:
The patent segments the evaluation process into two distinct phases: first evaluating nondisjunctive Boolean expressions on single tables using a storage engine, then evaluating disjunctive Boolean expressions on the filtered results using a relational engine. This segmentation allows each engine to operate on optimized data subsets, reducing overall processing resources and time while maintaining complete query result accuracy.
Solution Approach 2:
The patent performs preliminary filtering by evaluating nondisjunctive Boolean expressions on single tables before the main disjunctive evaluation. This preliminary action reduces the data volume that needs to be transferred and processed in the subsequent disjunctive evaluation phase, thereby improving processing efficiency without compromising result completeness.
2Reliability
If data tables are transferred to a second processor for evaluating disjunctive Boolean expressions, then accurate results are obtained, but data transfer overhead and processing time increase
Solution Approach 1:
The patent performs preliminary filtering on single tables using nondisjunctive Boolean expressions before transferring data to the relational engine. This preliminary action reduces the volume of data that needs to be transferred, thereby minimizing data transfer time and overhead while ensuring that only relevant data is processed in the final evaluation phase, maintaining accuracy.
Solution Approach 2:
The patent extracts and evaluates the nondisjunctive portion of Boolean expressions separately on single tables using a storage engine, removing this processing burden from the main disjunctive evaluation path. This extraction reduces the data volume requiring transfer to the relational engine, decreasing transfer time while preserving evaluation accuracy for the disjunctive components.
3Ease of operation
If conventional systems process analytic queries with disjunctive Boolean expressions, then query completion is achieved, but processing resources are excessively consumed
Solution Approach 1:
The patent segments the Boolean expression evaluation into nondisjunctive and disjunctive components, processing each with the most appropriate engine. Nondisjunctive expressions are evaluated on single tables using a storage engine, while disjunctive expressions are evaluated on filtered results using a relational engine. This segmentation reduces overall processing resource consumption while maintaining full query execution capability.
Solution Approach 2:
The patent changes the processing parameters by evaluating nondisjunctive Boolean expressions on single tables first, which reduces the data volume parameter for subsequent disjunctive evaluation. This parameter change in data volume leads to reduced processing resource consumption while preserving the system's ability to execute complex analytic queries.
Data Source
AI summary
Systems and methods for evaluating analytic queries comprising disjunctive Boolean expressions are described. A method may include receiving an analytic query comprising a first disjunctive Boolean expression. The method may further include transforming the analytic query to obtain a transformed analytic query comprising at least one nondisjunctive Boolean expression and at least a second disjunctive Boolean expression. The method may also include evaluating the transformed analytic query, wherein complete evaluation of the at least one nondisjunctive Boolean expressions and the at least a second disjunctive Boolean expressions yields the same results as evaluation of the first disjunctive Boolean expression.


