Blocked Index Join Execution Using Precomputed Row Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database management systems face challenges in optimizing performance for complex queries and queries involving blocked index joins, particularly due to the computational expense and inefficiencies in existing index join processes, which lead to increased processing burden and reduced response times.
Innovation Solution
A decoupled execution engine that optimizes query plans and executes complex operations independently from the database layer, supporting various database types, including row-store and column-store databases, by using pre-compiled and just-in-time generated code to reduce processing burden on the database layer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional index join processes are used to join data in database tables, then join operations can be performed, but processing burden increases and response times decrease due to computational expense and inefficiencies
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing join index structures before query execution. The join index is built in advance containing pre-processed join information, allowing queries to leverage this pre-computed data rather than performing expensive join operations at query time, thus improving processing speed and reducing response time
Solution Approach 2:
The patent creates a copy of the join index structure that can be independently queried without accessing the base tables. This copy contains the essential join information in an optimized format, allowing fast retrieval and join operations without the computational overhead of traditional index joins, thereby improving productivity and reducing response time
2Adaptability or versatility
If complex multidimensional analysis queries are executed on large datasets, then analytical capabilities are enhanced, but database performance optimization becomes more challenging
Solution Approach 1:
The patent segments the complex query processing into multiple independent components: the join index structure is separated from base tables, and query execution is divided into index lookup and result assembly phases. This segmentation allows each component to be optimized independently, enhancing the system's ability to handle complex multidimensional queries while simplifying performance optimization
Solution Approach 2:
The patent introduces a join index as an intermediary structure between base tables and queries. This intermediary pre-computes and stores join relationships, allowing complex analytical queries to be answered by querying the index rather than performing expensive joins on base tables, thus enhancing query capabilities while reducing optimization complexity
Data Source
AI summary
A method, a system, and a computer program product for executing a blocked index join. One or more join values for joining data stored in a database in response to a query for accessing data stored in the database are identified. The database stores data in a plurality of tables. Each table has a plurality of columns and a plurality of rows. A mapping of one or more rows in the plurality of rows corresponding to one or more join values to a number of rows including one or more join values is identified. Based on the mapping, a join of one or more join values based on the rows including one or more join values is executed. The joined values are outputted.