Relational Database Tuning via SQL Pattern Aggregation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional database tuning methods are inefficient for large-scale relational databases, particularly in identifying and optimizing SQL commands that cause bottlenecks, and the automatic generation of indexes can adversely affect performance when applied to columns used by multiple SQL commands.
Innovation Solution
A tuning apparatus and method that aggregates SQL commands into acquisition patterns based on search condition and method information, generating a tuning table to analyze and optimize performance by reducing the number of targets and selecting optimal indexes based on usage and execution metrics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If SQL commands are analyzed and tuned individually for each command, then tuning precision for that specific command is improved, but the workload and complexity for administrators increases significantly
Solution Approach 1:
The patent groups multiple SQL commands that share similar search conditions and methods into acquisition patterns. By merging individual command analyses into pattern-based groupings, the system maintains precise tuning for each command type while reducing overall administrative workload. The generating unit creates tuning tables that apply optimized parameters across entire groups of similar commands rather than treating each command in isolation.
Solution Approach 2:
The patent creates acquisition patterns that serve as universal templates for multiple SQL commands. A single acquisition pattern can represent many different commands that share the same search characteristics, allowing the tuning system to handle diverse commands through a unified approach. This multi-functionality reduces complexity while maintaining the ability to precisely tune each command variant within the pattern.
2Speed
If indexes are automatically generated and added to columns based on SQL command frequency, then search efficiency is improved, but update performance may deteriorate due to excessive indexing
Solution Approach 1:
The patent analyzes acquisition patterns to identify specific columns that benefit from indexing based on their actual usage in search conditions. Rather than automatically indexing all frequently accessed columns, the system selectively applies indexing only to columns where it provides local optimization value. The tuning table generates targeted index recommendations that improve search efficiency for specific pattern types without unnecessarily impacting update performance across the entire database.
Solution Approach 2:
The patent avoids excessive indexing by applying index generation selectively based on pattern analysis results. Instead of adding indexes to all columns that appear in SQL commands, the system identifies the subset of columns within each acquisition pattern that would most benefit from indexing. This partial action approach ensures search efficiency improvements while minimizing the negative impact on update operations.
3Adaptability or versatility
If the database is large-scale with many SQL commands, then the database functionality and data capacity are improved, but the time and effort required to identify bottleneck commands increases
Solution Approach 1:
The patent segments the large set of SQL commands into distinct acquisition patterns based on shared search conditions and methods. This segmentation divides the overwhelming task of analyzing all individual commands into manageable pattern groups. The extracting unit identifies commonalities among commands and groups them accordingly, allowing administrators to focus on optimizing patterns rather than individually analyzing each command in a large-scale database.
Solution Approach 2:
The patent extracts the essential characteristics (search conditions and search methods) from individual SQL commands to create acquisition patterns. By taking out and abstracting the common elements that define command behavior, the system reduces the complexity of bottleneck identification. Instead of examining every detail of each command, the extracting unit isolates the key pattern-defining features that determine optimization strategies.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A tuning apparatus and a tuning method are provided, which make it possible to provide higher-accuracy searching tuning, while still reducing work load for the tuning executed every query language used to operate the relational database, and provide optimum indexes considering effect of the performance of commands not being processed for the tuning. Commands issued using query languages such as SQL are aggregated as acquisition patterns each consisting of search condition information and search method information which are for acquiring search results of data from a relational database. Predetermined execution information provided when the issued commands are executed is made to correspond to the acquisition patterns, thereby providing tuning information to each of the acquisition patterns. Based on the tuning information to each of the acquisition patterns, a tuning table is generated for each of objects which compose the relational database, thereby physically reducing the number of targets being analyzed for the tuning.