Query Execution Mode Selection via Role Reassignment Constraints

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing database systems face limitations in processing speed due to hardware constraints, data storage methods, and restricted co-processing options, leading to inefficiencies in query execution.

Innovation Solution

A database system architecture that employs parallelized data input, storage, retrieval, and query processing across multiple computing devices, utilizing a parallelized data input sub-system, query and response sub-system, and administrative sub-system to optimize query execution through node reassignment and redundancy encoding, ensuring efficient data partitioning and processing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If parallelized processing across multiple computing devices is implemented, then query execution speed is improved, but system complexity increases

Engineering Contradiction:

Improvequery execution speedVSAvoidsystem complexity

Core Design Contradiction:

SpeedVSDevice complexity

Solution Approach 1:

The patent divides the database system into multiple independent computing devices (nodes), each capable of processing queries in parallel. The data is partitioned across these nodes, allowing simultaneous query execution on different data segments, thereby improving query execution speed while managing system complexity through modular architecture

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Each computing device in the parallelized system is designed to perform multiple functions including data storage, query processing, and coordination tasks. This multi-functionality allows the system to achieve high query execution speed without proportionally increasing overall system complexity, as each node serves several purposes

Inventive Principle:

Principle #6Universality (Multi-functionality)

2Productivity

If node reassignment during query execution is implemented, then resource utilization is optimized, but coordination overhead increases

Engineering Contradiction:

Improveresource utilization efficiencyVSAvoidcoordination overhead

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent implements dynamic node reassignment during query execution, where the system can adaptively redistribute query processing tasks across available computing devices based on current system state and resource availability. This dynamic approach optimizes resource utilization by allowing nodes to take on different roles during different phases of query execution

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

The system incorporates feedback mechanisms that monitor query execution progress and node status, enabling intelligent reassignment decisions. Based on feedback about query progress and resource availability, the system dynamically adjusts which nodes process which query portions, optimizing overall productivity while managing coordination through structured feedback loops

Inventive Principle:

Principle #23Feedback

3Productivity

If lock-free parallel operations are used, then query execution efficiency is improved, but ensuring data consistency becomes more difficult

Engineering Contradiction:

Improvequery execution efficiencyVSAvoiddata consistency

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent replaces traditional lock-based synchronization mechanisms with alternative approaches such as optimistic concurrency control or vector clocks. This substitution eliminates the performance overhead of locks while maintaining data consistency through cryptographic or algorithmic verification methods, thereby improving query execution efficiency without sacrificing reliability

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

Solution Approach 2:

The system creates and maintains copies of data across multiple nodes with version tracking. Instead of using locks to prevent concurrent access, the system allows parallel operations on data copies and uses version vectors or timestamps to detect and resolve conflicts, ensuring data consistency while enabling lock-free parallel execution

Inventive Principle:

Principle #26Copying

Data Source

PatentUS12511302B2Facilitating query executions via role reassignment modality

Publication Date: 2025.12.30 OCIENT HOLDINGS LLC

AI summary

A query processing system operates by: receiving a first query request that indicates a first query for execution by a database system; determining a first plurality of query execution mode options for execution of the first query via the database system; generating first role reassignment restriction data for the first query based on a first plurality of query operators of the first query; selecting a first selected query execution mode from the first plurality of query execution mode options based on role reassignment modality corresponding to the first selected query execution mode comparing favorably to the first role reassignment restriction data; and generating a resultant for the first query by facilitating execution of the first query in accordance with the first selected query execution mode.