Database Index Structure Using Bitmap Vectors for Flexible Querying

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current solutions for querying and analyzing datasets are either too complex for average users or restrictive in terms of flexibility and ease of use, often being sensitive to structural changes in the data.

Innovation Solution

A data model resembling how the human brain associates information, with objects that contain relevant attributes and relations, allowing users to query and analyze datasets without needing to understand the underlying structure, using bitmap-based index structures and reflective logic to handle flexible and easy querying.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If complete access to the underlying data model is provided, then flexibility in querying and analyzing datasets is improved, but ease of operation deteriorates due to complexity requirements

Engineering Contradiction:
Improveflexibility in queryingVSAvoidease of use
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent introduces an intermediary information model layer between the user and the underlying data model. This information model provides a simplified, domain-specific interface that translates user queries into operations on the complex underlying data model, thereby maintaining flexibility while improving ease of operation.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent segments the data access interface into two distinct layers: the underlying data model for flexible data representation and the information model for user-friendly querying. This segmentation allows each layer to optimize for its specific purpose without compromising the other.

Inventive Principle:
Principle #1Segmentation

2Ease of operation

If an information model tailored to a specific problem domain is used, then ease of operation is improved, but flexibility in querying and analyzing datasets deteriorates

Engineering Contradiction:
Improveease of queryingVSAvoidflexibility in analysis
Core Design Contradiction:
Ease of operationVSAdaptability or versatility

Solution Approach 1:

The information model is designed to be multi-functional, serving both as a simplified interface for domain-specific queries and as a bridge to the underlying flexible data model. This allows the system to provide ease of operation for common domain queries while maintaining the flexibility to handle complex analytical operations through the translation mechanism.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Ease of operation

If predefined rules are used to translate between information model and data model, then ease of operation is improved, but sensitivity to structural changes worsens

Engineering Contradiction:
Improveease of useVSAvoidsensitivity to structural changes
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The translation mechanism between the information model and data model is designed to be dynamic rather than static. The system can adapt the translation rules based on the actual structure of the underlying data, allowing it to maintain ease of operation while being resilient to structural changes in the data model.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS10409798B2Method of providing an index structure in a database
Publication Date: 2019.09.10 CAPISH INT
  • US10409798B2 patent drawing
  • US10409798B2 patent drawing
  • US10409798B2 patent drawing

AI summary

A method of providing an index structure in a database comprising a plurality of types of objects, each type of objects comprising at least one object. It comprises the steps setting one position of an identity index bit vector of each object in said database to one and all other positions to zero, said position being different for each object, and forming, for each object in said database, a relation index bit vector by combining all identity index bit vectors of objects that said each object is related to, wherein each bit vector has a length equal to the number of objects.