Federated Query Cache Management via Unique Hash Identification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing federated query engines face challenges in efficiently processing federated queries due to the time-consuming and resource-intensive nature of generating result datasets, particularly when dealing with complex queries and redundant caches.

Innovation Solution

The proposed solution involves using unique hashes to identify and disambiguate between multiple federated queries. This is achieved by creating an execution plan with executable tasks, converting them into task strings, refining these strings to remove non-universal features, and then hashing them to generate task-specific hashes. These hashes are used to compare against historical result set hashes to determine query uniqueness, allowing for tailored caching and resource allocation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If traditional local caching mechanisms are used with preset TTL parameters for federated queries, then cache management is simplified, but the cache efficacy is limited and cannot be dynamically optimized for complex federated queries

Engineering Contradiction:
Improvecache management simplicityVSAvoidcache efficacy
Core Design Contradiction:
Ease of manufactureVSProductivity

Solution Approach 1:

The patent implements dynamic TTL parameter generation by analyzing query characteristics, data source properties, and result set attributes to automatically determine optimal cache durations. This replaces static preset TTL values with dynamically adjusted parameters that adapt to each federated query's specific needs, thereby improving cache efficacy while maintaining manageable complexity through automated decision-making

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes the TTL parameter from a fixed preset value to a dynamically determined value based on multiple factors including query complexity, data source reliability, and result set characteristics. This parameter transformation enables the cache to be optimized for each specific federated query scenario, resolving the contradiction between simplicity and efficacy

Inventive Principle:
Principle #35Parameter changes

2Device complexity

If multiple federated queries are cached without unique identification, then cache storage is simplified, but redundant caches are created that store the same or similar data sets

Engineering Contradiction:
Improvecache structure simplicityVSAvoidredundant data storage
Core Design Contradiction:
Device complexityVSLoss of substance

Solution Approach 1:

The patent extracts the essential characteristics of each federated query into a unique hash identifier by processing the execution plan and removing non-universal features. This extracted identifier is then used to index and manage cache entries, enabling the system to distinguish between different queries while maintaining a simplified cache structure through efficient lookup mechanisms

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The system creates a simplified representation (hash) of each federated query's execution plan that captures its essential identity without storing the full query complexity. This copied identifier enables efficient comparison and deduplication operations, preventing redundant cache storage while maintaining structural simplicity

Inventive Principle:
Principle #26Copying

3Speed

If federated queries are processed without unique identification, then query processing is faster, but query disambiguation fails leading to incorrect cache hits

Engineering Contradiction:
Improvequery processing speedVSAvoidquery disambiguation accuracy
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent performs preliminary processing of the federated query execution plan to generate a unique hash identifier before the actual query execution and caching operations. This pre-computed identifier is stored alongside the result set, enabling fast and reliable disambiguation during cache lookup operations without slowing down the main query processing pipeline

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The unique hash identifier acts as an intermediary between the complex federated query and the simple cache storage system. It provides a reliable bridge that enables fast comparison operations while ensuring accurate query disambiguation, resolving the contradiction between processing speed and disambiguation reliability

Inventive Principle:
Principle #24Intermediary (Mediator)

4Productivity

If complex federated queries are cached with dynamic TTL parameters, then cache optimization is improved, but the system complexity increases due to hash generation and query analysis

Engineering Contradiction:
Improvecache optimizationVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system implements self-service by automatically analyzing query characteristics and generating appropriate TTL parameters and unique identifiers without requiring external configuration or manual intervention. The federated query engine itself performs the analysis and hash generation, eliminating the need for separate complex management systems while achieving dynamic optimization

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS12204538B1Dynamically tailored time intervals for federated query system
Publication Date: 2025.01.21 OPTUM INC
  • US12204538B1 patent drawing
  • US12204538B1 patent drawing
  • US12204538B1 patent drawing

AI summary

Various embodiments of the present disclosure provide federated query processing techniques for dynamically tailoring the use and parameters of intermediary local sources based on the identification of federated query. The techniques include receiving an execution plan for executing a federated query that include a plurality of executable tasks for generating a result set from a plurality of third-party data sources. The techniques include generating a result set hash for the result set based on the execution plan and determining a query uniqueness status for the federated query based on a comparison between the result set hash and a plurality of historical result set hashes. In response to determining that the federated query is a unique query, the techniques include generating a time interval that is tailored to the unique query.