Distributed Database Query Cancellation via Local Node Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In distributed database systems, effectively canceling resource-hungry queries across multiple computing resources is challenging due to the need for sharing information between numerous computers, leading to poor computational performance.

Innovation Solution

A distributed database architecture where each node performs single node query execution analysis to selectively produce a query cancellation command, allowing local decision-making for query cancellation without requiring communication between nodes, using a resource monitoring module and request cancellation module to propagate and enforce cancellation commands.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If query cancellation is implemented in a distributed database system by sharing information between numerous computers, then query cancellation capability is achieved, but system complexity and communication overhead increase significantly

Engineering Contradiction:
Improvequery cancellation capabilityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent divides the distributed database system into independent node units, where each node autonomously performs query execution analysis and makes local cancellation decisions. This segmentation eliminates the need for complex inter-node communication protocols and information sharing mechanisms, resolving the contradiction between achieving query cancellation capability and reducing system complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Each node in the distributed system is equipped with the capability to independently analyze query execution and make cancellation decisions based on local resource conditions. This self-service approach allows nodes to autonomously manage query cancellation without relying on centralized coordination or extensive inter-node communication, thereby achieving query cancellation capability while minimizing system complexity

Inventive Principle:
Principle #25Self-service

2Reliability

If query cancellation requires information sharing between numerous computers in a distributed system, then centralized control is achieved, but computational performance deteriorates due to communication overhead

Engineering Contradiction:
Improvecentralized controlVSAvoidcomputational performance
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent segments the centralized control function into distributed autonomous decision-making capabilities at each node. By dividing the control authority and enabling local nodes to independently analyze and decide on query cancellation, the system eliminates communication overhead while maintaining effective query control, thus preserving computational performance

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Instead of implementing centralized control through information gathering and decision propagation, the patent inverts the approach by enabling distributed autonomous decision-making. Each node independently makes cancellation decisions based on local conditions, eliminating the communication overhead inherent in centralized control while achieving effective query management

Inventive Principle:
Principle #13The other way round (Inversion)

Data Source

PatentUS11520593B1Apparatus and method for distributed database query cancellation based upon single node query execution analysis
Publication Date: 2022.12.06 PROGRESS FEDERAL SOLUTIONS INC
  • US11520593B1 patent drawing
  • US11520593B1 patent drawing

AI summary

A master database module is on a master computer node. Slave database modules are on slave computer nodes connected to the master computer node via a network. A distributed database includes executable code executed by processors on the master computer node and the slave computer nodes to receive a distributed database query at the master computer node. A query execution plan is prepared at the master computer node. The query execution plan is deployed on the slave computer nodes. The query execution plan is executed on the slave computer nodes. The slave computer nodes each perform a single node query execution analysis to selectively produce a query cancellation command. The query cancellation command is propagated to the master computer node and the slave computer nodes. The query execution plan is cancelled on the master computer node and the slave computer nodes.