Dynamic Database Partitioning for Query Speed Optimization

Solution Overview

Problem

In database systems, range partitioning leads to data overconcentration in unspecified partitions, reducing query speed and computational efficiency due to indiscriminate searching through irrelevant data.

Innovation Solution

Implement dynamic range partitioning by generating partitions with specified ranges upon data insertion, allowing for pruning of unnecessary partitions during queries and minimizing data movement across nodes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Stability of the object's composition

If range partitioning is used to organize database data, then data organization is improved, but data overconcentration in unspecified partitions occurs reducing query speed

Engineering Contradiction:

Improvedata organizationVSAvoidquery speed

Core Design Contradiction:

Stability of the object's compositionVSSpeed

Solution Approach 1:

The patent implements dynamic range partitioning where partition ranges are not fixed but adapt based on the distribution of actual data values. The system dynamically determines partition boundaries by analyzing data insertion patterns and redistributing data to balance partitions, preventing data overconcentration and maintaining optimal query performance as data evolves over time

Inventive Principle:

Principle #15Dynamics

2Adaptability or versatility

If unspecified partitions are used to accommodate unknown data ranges, then adaptability is improved, but indiscriminate searching through irrelevant data increases reducing computational efficiency

Engineering Contradiction:

Improveadaptability to unknown data rangesVSAvoidcomputational efficiency

Core Design Contradiction:

Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent performs preliminary analysis of data value distributions before finalizing partition boundaries. By examining the range and distribution of data values that will be inserted, the system pre-determines optimal partition boundaries that ensure balanced data distribution, eliminating the need for unspecified partitions and preventing computational waste from searching irrelevant data

Inventive Principle:

Principle #10Preliminary action

3Adaptability or versatility

If dynamic partition generation is implemented to accommodate new data ranges, then adaptability is improved, but data movement across nodes increases

Engineering Contradiction:

Improveadaptability to new data rangesVSAvoiddata movement

Core Design Contradiction:

Adaptability or versatilityVSWeight of moving object

Solution Approach 1:

The patent performs preliminary analysis of data value distributions before finalizing partition boundaries. By examining the range and distribution of data values that will be inserted, the system pre-determines optimal partition boundaries that ensure balanced data distribution, eliminating the need for unspecified partitions and preventing computational waste from searching irrelevant data

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS11741127B2Dynamic range partitioning of database table

Publication Date: 2023.08.29 SAP SE

AI summary

A method may include generating a database table to include a first partition having a first range and a dynamic partition associated with an undefined range of a specified length. A record may be inserted into the database table. In response to one or more values of the record being outside of the first range of the first partition, a second partition having a second range of the specified length that includes the one or more values of the record may be generated. The record may be stored in the second partition. Moreover, a query on the database table may be executed by the first partition and/or the second partition of the database table. Related systems and articles of manufacture are also provided.