Database Index Integrity Validation via Hash Comparison

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Large and complex databases often have indexes that are not up-to-date or incomplete, leading to inaccurate search results, which can result in critical decisions based on erroneous data, especially in safety-critical systems, and existing solutions like disclaimers are often ignored by users.

Innovation Solution

A method and system that validate query results by performing hash operations on both database and index data, comparing the hash values to guarantee data integrity and providing users with assurance or warnings about the accuracy of the results.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If indexes are used to improve search speed, then data retrieval speed is improved, but data integrity and accuracy deteriorate due to potential out-of-date or incomplete index data

Engineering Contradiction:
Improvedata retrieval speedVSAvoiddata integrity
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The system performs preliminary hash computation on index data before it is used for queries. By pre-computing and storing hash values of index data, the system can quickly verify integrity without needing to re-process the entire index, thus maintaining both speed and reliability.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements a feedback mechanism where hash values of index data are compared against corresponding database data hashes. When discrepancies are detected, the system provides feedback to users about potential data integrity issues, allowing them to make informed decisions about whether to trust the index results.

Inventive Principle:
Principle #23Feedback

2Reliability

If indexes are updated frequently to maintain accuracy, then data integrity is improved, but storage space requirements and system complexity increase

Engineering Contradiction:
Improvedata integrityVSAvoidindex maintenance complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system extracts only the essential integrity verification information (hash values) from the index data, rather than maintaining complete copies of the index for verification purposes. This allows the system to verify integrity without duplicating the entire index structure, reducing storage and complexity requirements.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

Instead of copying the entire index data structure for verification, the system creates and stores only hash copies of the index data. These hash copies are much smaller and sufficient for integrity verification, eliminating the need to maintain full index copies while still providing reliable integrity checking.

Inventive Principle:
Principle #26Copying

3Reliability

If users are provided with disclaimers about index accuracy, then data integrity warnings are provided, but user trust and ease of operation deteriorate as users may ignore warnings

Engineering Contradiction:
Improvedata integrity awarenessVSAvoiduser trust
Core Design Contradiction:
ReliabilityVSEase of operation

Solution Approach 1:

The system uses visual indicators (analogous to color changes) to communicate data integrity status. By providing clear visual feedback about index data reliability, the system makes integrity information immediately noticeable and difficult to ignore, improving both user awareness and trust without adding complexity to the user interface.

Inventive Principle:
Principle #32Color changes

Data Source

PatentUS11836126B2Method and system for indicating data index integrity
Publication Date: 2023.12.05 DASSAULT SYSTEMS AMERICAS CORP
  • US11836126B2 patent drawing
  • US11836126B2 patent drawing
  • US11836126B2 patent drawing

AI summary

A method for validating a query result for a query of a database uses an index of the database. A selection of a set of source data from the database is received and a first hash operation is performed on the source data in the database resulting in a database hash value for the source data. A second hash operation is performed on the source data in the index resulting in an index hash value. The index hash value is compared with the database hash value, and a guarantee indication is provided for the source data in the index.