Bitmap Index Data Search Using Logical Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data search techniques are inefficient in retrieving character strings from document data at high speeds due to the need to verify consecutive character positions, which slows down the retrieval process.
Innovation Solution
A data search program that uses bitmap indices to perform logical operations between search character strings and target text data, considering the appearance positions of characters or words, allowing for fast retrieval by shifting and performing AND operations on bitmaps to determine the presence of consecutive characters or words.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If bitmap indices are used for character-level searching, then search speed is improved, but the complexity of verifying consecutive character positions increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing position information for each character in the bitmap index before the actual search occurs. When searching for a character string, the system retrieves pre-stored position data and performs simple comparisons rather than verifying consecutiveness in real-time, thus resolving the contradiction between search speed and verification complexity
Solution Approach 2:
The patent introduces an intermediary mechanism by using a separate position information storage structure that mediates between the bitmap index and the search query. This intermediary layer stores pre-computed position data, allowing the search system to quickly verify character consecutiveness without complex real-time calculations, thereby maintaining high search speed while reducing verification complexity
2Measurement precision
If lexical analysis is performed for word extraction in CJK documents, then search accuracy is improved, but processing cost and time increase
Solution Approach 1:
The patent applies copying by creating a simplified copy of word position information from the original CJK text and storing it in the bitmap index during preprocessing. This copied position data allows subsequent searches to use simple character matching without performing expensive lexical analysis, thus maintaining search accuracy while dramatically improving processing efficiency
Solution Approach 2:
The patent uses preliminary action by performing word position extraction and storing it in advance during the indexing phase. This pre-computed position information is stored in the bitmap index structure, allowing the search phase to operate efficiently with simple character matching rather than requiring time-consuming lexical analysis during actual searches, thereby resolving the contradiction between accuracy and efficiency
Data Source
Figure 1
Figure 2
Figure 3
AI summary
An information processing device (100) receives a search character string for target text data, and searches for the search character string by a logical operation between a bitmap index associated with appearance positions in the target text data of each of characters or words appearing in the target text data as bitmap data and search bitmap data generated to be associated with an appearance order in the search character string of respective characters or respective words constituting the search character string.