Positional Text Index Bitmap Acceleration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database systems face inefficiencies in processing queries with positional text conditions and bitmap-based methods, as there is no effective mechanism to utilize bitmap information for quick evaluation of positional text queries, leading to inefficient row evaluation and lack of advanced indexing for positional text searches.
Innovation Solution
The implementation of a positional text index structure that includes bitmap information, allowing for the intersection and combination of bitmaps to identify candidate rows and provide position information efficiently, thereby accelerating query processing by constraining the search to only relevant rows that satisfy the conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If bitmap-based methods are used for evaluating conditions over columns, then the combination of multiple conditions becomes efficient, but positional text conditions cannot be effectively evaluated
Solution Approach 1:
The patent combines bitmap-based condition evaluation with positional text condition evaluation by integrating positional information into the bitmap index structure. This allows the system to maintain the efficiency of bitmap methods while adding the capability to evaluate positional text conditions, resolving the contradiction between productivity and adaptability.
Solution Approach 2:
The patent segments the query evaluation process into two phases: first using bitmap information to identify candidate rows efficiently, then evaluating positional text conditions only on those candidate rows. This segmentation maintains overall efficiency while enabling positional text condition support.
2Measurement precision
If full traversal of data structures is performed to evaluate positional text conditions, then accurate results are obtained, but processing time increases significantly
Solution Approach 1:
The patent applies partial action by performing full positional text condition evaluation only on a subset of candidate rows identified by bitmap filtering, rather than traversing all rows in the table. This reduces processing time significantly while maintaining accuracy for the relevant subset.
Solution Approach 2:
The patent performs preliminary filtering using bitmap information to identify candidate rows before evaluating positional text conditions. This preliminary action reduces the search space and enables faster processing while ensuring no relevant rows are missed.
3Device complexity
If no bitmap information is used for positional text queries, then simple data structure traversal is possible, but query processing efficiency is poor
Solution Approach 1:
The patent segments the index structure into bitmap information for efficient filtering and positional information for accurate text condition evaluation. This segmentation enables fast query processing by using the bitmap layer to eliminate irrelevant rows before detailed positional analysis.
Solution Approach 2:
The patent pre-computes and stores bitmap information that indicates the presence of search terms in rows. This preliminary action enables rapid filtering of candidate rows before performing more expensive positional text condition evaluations, significantly improving query processing speed.
Data Source
AI summary
A system, method, and computer program product are provided for improving performance of positional text conditions in concert with bitmap-based conditions. This is accomplished, for example, by focusing positional text condition evaluation to candidate rows based on a bitmap resulting from application of a prior condition. Additionally, the result of a positional text condition may itself be provided in the form of a bitmap to accelerate further bitmap-based condition processing.