Pivot Query Processing Using Search Table Filtering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database management systems face inefficiencies in processing pivot queries due to increased computation time as the number of classification criteria grows, leading to slower query processing performance.
Innovation Solution
A computer program that identifies classification factors in a pivot query, generates a search table for filtering records, and aggregates data using this table to create a result table, reducing the need for direct comparisons and thereby minimizing computation time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If records in the table are compared with classification criterion expressions to identify classification records in pivot query processing, then accurate classification can be achieved, but query processing time increases as computation amount increases
Solution Approach 1:
The patent creates a search table in advance that stores classification criterion expressions and their corresponding row locations. This preliminary action allows the system to quickly retrieve pre-computed classification information during pivot query processing, avoiding the need to compare each record with multiple classification expressions in real-time, thus reducing query processing time while maintaining classification accuracy
Solution Approach 2:
The patent creates a search table that is a simplified copy or representation of the classification criteria structure. Instead of directly comparing records with the original classification expressions, the system uses this copied search table structure to quickly identify classification records, significantly reducing the computational complexity of the comparison operation
2Adaptability or versatility
If multiple classification criterion expressions are used in pivot queries, then more comprehensive data classification can be achieved, but computation amount increases leading to inefficient processing
Solution Approach 1:
The patent segments the classification criterion expressions into individual entries in the search table, with each expression stored separately with its corresponding row location. This segmentation allows the system to efficiently handle multiple classification criteria by processing them as discrete, pre-organized units rather than as a complex combined operation, maintaining versatility while improving processing efficiency
Solution Approach 2:
The search table is constructed in advance to organize multiple classification criterion expressions and their corresponding row locations. This preliminary organization enables the system to efficiently process comprehensive classification requirements without incurring the full computational cost during actual pivot query execution, as the heavy lifting of organizing classification criteria is done beforehand
Data Source
AI summary
Disclosed is a non-transitory computer readable medium storing computer program which is executable by one or more processors. The computer program allows the one or more processors to execute the following operations for performing a pivot query when the computer program is executed by one or more processors and the operations may include: identifying one or more classification factors from a query when receiving the query from a client; generating a search table for filtering records corresponding to at least one row of a table corresponding to the query based on the one or more classification factors; and generating a result table by performing an aggregation of a plurality of records included in the table based on the search table.