Query Record Estimation for Resource-Limited Database Queries

Solution Overview

Problem

Database servers face resource exhaustion due to excessive query requests, leading to potential denial of service attacks and inefficient resource utilization, especially in multi-dimensional databases with large record sets.

Innovation Solution

Implement a method and system that estimates the number of query records based on historical data and correlations within a multi-dimensional database, allowing the server to execute queries only if the estimated count does not exceed a predetermined threshold, thereby preventing resource exhaustion.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If the server executes all incoming search queries on the multi-dimensional database, then query processing completeness is improved, but resource exhaustion and denial of service occur due to excessive query requests

Engineering Contradiction:

Improvequery processing completenessVSAvoidservice availability

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The system performs preliminary estimation of the record count for each incoming search query using historical data and correlation information before actually executing the query. This preliminary action allows the server to identify and filter out queries that would return excessive records and consume disproportionate resources, while still accepting and processing queries with reasonable expected result sizes

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary estimation mechanism that sits between the query receiver and the query execution engine. This intermediary layer uses pre-computed historical data and correlation factors to predict the outcome of queries without actually executing them, thereby protecting the database from harmful queries while allowing legitimate queries to pass through to the execution engine

Inventive Principle:

Principle #24Intermediary (Mediator)

2Loss of information

If the server processes queries with large record sets, then comprehensive data retrieval is improved, but resource utilization becomes inefficient due to excessive processing overhead

Engineering Contradiction:

Improvedata retrieval completenessVSAvoidprocessing resource consumption

Core Design Contradiction:

Loss of informationVSUse of energy by moving object

Solution Approach 1:

The system performs preliminary estimation of the record count for each incoming search query using historical data and correlation information before actually executing the query. This preliminary action allows the server to identify and filter out queries that would return excessive records and consume disproportionate resources, while still accepting and processing queries with reasonable expected result sizes

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The system uses its own historical query execution data and internal correlation information to make estimation decisions, rather than requiring external validation or pre-computation of all possible query outcomes. The pre-computed data sources are generated and maintained by the system itself through normal operation, creating a self-sustaining estimation mechanism

Inventive Principle:

Principle #25Self-service

Data Source

PatentUS12367195B1Query record estimator

Publication Date: 2025.07.22 VISA INTERNATIONAL SERVICE ASSOCIATION

AI summary

A method and system for efficiently executing query requests based on an estimated number of query records returned. A database server may set a predetermined record count associated with an estimated number of query records. The predetermined record count prevents a single query or multiple queries from intentionally or unintentionally consuming an excessive amount of computational resources. If the estimated number of query records exceed the predetermined record count the database server may cancel or prevent the execution of the query request in order to prevent one or more query requests from consuming an excessive amount of computing resources.