Database Query Index Leap Skipping for Non-Relational Join Performance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Non-relational databases face limitations in index usage, leading to low query efficiency due to unnecessary scanning of index entries and poor performance in multi-table join operations, even with indexes created for multiple tables.
Innovation Solution
A method for processing database queries by receiving a query for a group of data records with indexes created on specific fields, determining if the query satisfies a predetermined condition, and skipping unnecessary operations based on the indexes to improve query efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If indexes are created on data tables in non-relational databases, then query efficiency should be improved, but query efficiency remains low due to unnecessary scanning of index entries
Solution Approach 1:
The patent applies the skipping principle by enabling the database query processor to skip unnecessary index entry scans. When a query is executed, the system determines which index entries can be skipped based on query conditions and index structure, thereby reducing the time spent scanning index entries while maintaining query efficiency.
2Productivity
If indexes are created on multiple tables, then multi-table join operations should be optimized, but performance in multi-table join operations remains poor
Solution Approach 1:
The patent applies preliminary action by pre-determining which index entries can be skipped before executing multi-table join operations. The query processor analyzes the query conditions and index structures in advance to identify skipable entries, thereby optimizing multi-table join performance by avoiding unnecessary scanning operations.
3Reliability
If all index entries are scanned to ensure complete query results, then query accuracy is maintained, but query execution time increases
Solution Approach 1:
The patent applies feedback by implementing a mechanism where the query processor continuously monitors and adjusts which index entries to scan based on query conditions and index structure. This feedback loop ensures that only necessary index entries are scanned, maintaining query result accuracy while reducing execution time by avoiding unnecessary scans.
Data Source
AI summary
Embodiments of the present disclosure relate to an approach for database query. According to the approach, a query for a group of data records is received. At least one index is created on at least one field of the data records and comprises index entries for storing and sorting respective values of the at least one field of the data records. It is determined if the query satisfies a predetermined condition. In response to the query satisfying the predetermined condition, a result of the query is determined by skipping at least a part of operations required by the query based on the at least one index.