Bitmap Index Tree Using Summary Values for User-Defined Types
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database management systems have limitations in using bitmap indexes, including restricted control over index construction, inability to index user-defined types, and lack of access to primitive operations for bitmap values, which restricts their applicability in representing subsets of large sets of objects.
Innovation Solution
The creation of an index tree that employs summary bitmap values, allowing aggregation operations like logical OR and AND, and providing methods for traversing and manipulating bitmap values to efficiently locate table rows based on bitmap indices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If bitmap indexes are used to represent subsets of objects, then query performance is improved, but the ability to index user-defined types and control index construction is restricted
Solution Approach 1:
The patent segments the index structure into multiple levels (leaf nodes containing individual bitmap values and internal nodes containing summary bitmap values). This segmentation allows the system to maintain efficient bitmap indexing for query performance while adding hierarchical organization that enables indexing of user-defined types and provides greater control over index construction and traversal.
Solution Approach 2:
The patent adds a hierarchical dimension to the traditional flat bitmap index structure by introducing internal nodes with summary bitmap values above the leaf nodes. This dimensional transformation from a single-level to multi-level structure enables the index to handle user-defined types and provides controlled access paths, thereby resolving the contradiction between query performance and adaptability.
2Quantity of substance
If bitmap values are used to represent subsets of large sets of objects, then storage efficiency is improved, but access control and manipulation capabilities are limited
Solution Approach 1:
The patent divides the large bitmap index into a hierarchical structure where leaf nodes store individual bitmap values and internal nodes store summary bitmap values. This segmentation maintains the storage efficiency of bitmap representation while enabling controlled access through the hierarchical structure, allowing users to traverse and manipulate specific portions of the index efficiently.
Solution Approach 2:
The patent performs preliminary aggregation of bitmap values into summary bitmap values at internal nodes during index construction. This preliminary action enables efficient traversal and controlled access by allowing the system to quickly determine which portions of the index are relevant, thereby improving ease of operation without sacrificing storage efficiency.
3Ease of manufacture
If traditional bitmap indexes are implemented, then simple subset representation is achieved, but control over index construction and traversal is restricted
Solution Approach 1:
The patent segments the index construction process into distinct phases: leaf node creation with individual bitmap values and internal node creation with summary bitmap values. This segmentation provides controlled construction while maintaining implementation simplicity, as each segment follows straightforward bitmap operations but the overall structure enables sophisticated control.
Solution Approach 2:
The patent introduces a hierarchical dimension to the index structure, transforming the flat construction approach into a multi-level construction process. This dimensional change provides controlled index construction and traversal paths while maintaining the simplicity of bitmap operations at each level, resolving the contradiction between simplicity and control.
Data Source
AI summary
A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. Objects containing bitmap values may be indexed by means of an index tree that includes summary bitmap values.